<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://msmvps.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx</link><description>This is a little project that myself and Luca have been working on in our spare (spare) time in the last month or so. The book is no where near complete but we wanted to get it out there now and progress with it in view of the public eye rather than just</description><dc:language>en</dc:language><generator>CommunityServer 2008.5 SP2 (Build: 40407.4157)</generator><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1656252</link><pubDate>Tue, 09 Dec 2008 10:22:19 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1656252</guid><dc:creator>Deepak Kumar</dc:creator><description>&lt;p&gt;Thanks 4 provide Data structures and Algorithms ebook&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1656252" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646775</link><pubDate>Thu, 04 Sep 2008 17:11:33 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646775</guid><dc:creator>Granville Barnett</dc:creator><description>&lt;p&gt;@Alun - there are many ways we can write the fib series. We made the decision to use the version already implemented as its clearer than the versions that are a little faster. Also we don&amp;#39;t see it as a *critical* algorithm. Its purely there for coverage, nothing more.&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646775" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646773</link><pubDate>Thu, 04 Sep 2008 17:03:49 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646773</guid><dc:creator>Alun Jones</dc:creator><description>&lt;p&gt;Your use of the fibonacci series in the recursive versus iterative section can do with some extension and connection to your &amp;quot;Big Oh&amp;quot; discussion - the naive recursive version is O(n*n) in execution time, but you can not only rewrite it as iterative (for O(n) time), you can rewrite it as recursive with O(n) time if the return value carries F(n) and F(n-1), and you can further write it as iterative using matrix multiplication for O(lgN) time, or using floating point in O(1) time (assuming that pow(x,n) is O(1)).&lt;/p&gt;
&lt;p&gt;Cheers,&lt;/p&gt;
&lt;p&gt;Alun.&lt;/p&gt;
&lt;p&gt;~~~~&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646773" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646620</link><pubDate>Wed, 03 Sep 2008 13:01:41 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646620</guid><dc:creator>Granville Barnett</dc:creator><description>&lt;p&gt;We are only using pseudocode I&amp;#39;m afraid. The decision was made a while back and I think it is best. &lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646620" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646619</link><pubDate>Wed, 03 Sep 2008 12:50:35 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646619</guid><dc:creator>John Jabot</dc:creator><description>&lt;p&gt;The content of the book looks really good. &amp;nbsp;Are you planning to add graph? Also, I think it&amp;#39;s better to add a sample code (just one language C#) in the book as well. &amp;nbsp;I know it&amp;#39;s going to be bulky.&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646619" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646098</link><pubDate>Thu, 28 Aug 2008 16:32:53 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646098</guid><dc:creator>Simone</dc:creator><description>&lt;p&gt;@Granville: you&amp;#39;re welcome&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646098" width="1" height="1"&gt;</description></item><item><title>Dew Drop - August 28, 2008 | Alvin Ashcraft's Morning Dew</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646078</link><pubDate>Thu, 28 Aug 2008 12:59:18 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646078</guid><dc:creator>Dew Drop - August 28, 2008 | Alvin Ashcraft's Morning Dew</dc:creator><description>&lt;p&gt;Pingback from &amp;nbsp;Dew Drop - August 28, 2008 | Alvin Ashcraft&amp;#39;s Morning Dew&lt;/p&gt;
&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646078" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646062</link><pubDate>Thu, 28 Aug 2008 10:26:24 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646062</guid><dc:creator>Granville Barnett</dc:creator><description>&lt;p&gt;Thanks Simone ;-)&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646062" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646049</link><pubDate>Thu, 28 Aug 2008 07:10:58 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646049</guid><dc:creator>Simone</dc:creator><description>&lt;p&gt;Great news:&lt;/p&gt;
&lt;p&gt;here is my &amp;quot;spreading of the word&amp;quot; :)&lt;/p&gt;
&lt;p&gt;&lt;a rel="nofollow" target="_new" href="http://codeclimber.net.nz/archive/2008/08/28/data-structure-and-algorithms-ebook.aspx"&gt;codeclimber.net.nz/.../data-structure-and-algorithms-ebook.aspx&lt;/a&gt;&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646049" width="1" height="1"&gt;</description></item><item><title>Reflective Perspective - Chris Alcock  &amp;raquo; The Morning Brew #167</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646044</link><pubDate>Thu, 28 Aug 2008 06:29:33 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646044</guid><dc:creator>Reflective Perspective - Chris Alcock  » The Morning Brew #167</dc:creator><description>&lt;p&gt;Pingback from &amp;nbsp;Reflective Perspective - Chris Alcock &amp;nbsp;&amp;raquo; The Morning Brew #167&lt;/p&gt;
&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646044" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646020</link><pubDate>Wed, 27 Aug 2008 21:49:03 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646020</guid><dc:creator>Granville Barnett</dc:creator><description>&lt;p&gt;@Frans - Duly noted. Will follow this up via email.&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646020" width="1" height="1"&gt;</description></item><item><title>re: Data Structures and Algorithms book (free) first preview available!</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646006</link><pubDate>Wed, 27 Aug 2008 18:36:41 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646006</guid><dc:creator>Frans Bouma</dc:creator><description>&lt;p&gt;If you need a fibonacci heap implementation, let me know (via email). I&amp;#39;m working on my own algorithm lib (bsd licensed, out this fall), but I think we are in the same boat that we want others to use algorithms which are discovered by very smart people sometimes decades ago, so the more spread these algorithms are, the better. :)&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646006" width="1" height="1"&gt;</description></item><item><title>Data Structures and Algorithms Book First Preview</title><link>http://msmvps.com/blogs/gbarnett/archive/2008/08/27/data-structures-and-algorithms-book-free-first-preview-available.aspx#1646004</link><pubDate>Wed, 27 Aug 2008 18:21:48 GMT</pubDate><guid isPermaLink="false">d67277c4-116b-43f1-b688-e9ef184ea916:1646004</guid><dc:creator>Community Blogs</dc:creator><description>&lt;p&gt;I think it’s quite a long while since Granville Barnett and Luca Del Tongo started their work on writing&lt;/p&gt;
&lt;img src="http://msmvps.com/aggbug.aspx?PostID=1646004" width="1" height="1"&gt;</description></item></channel></rss>