<?xml version="1.0" encoding="UTF-8"?>
<GoodreadsResponse>
	<Request>
		<authentication>false</authentication>
		    <method><![CDATA[]]></method>
	</Request>
	
<book>
  <id>2662710</id>
  <title><![CDATA[Art of Computer Programming/Sorting and Searching. (Addison Wesley Series in Computer Science and Information Processing)]]></title>
  <isbn><![CDATA[020103803X]]></isbn>
  <isbn13><![CDATA[9780201038033]]></isbn13>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <description><![CDATA[Knuth's multivolume work, widely  recognized as the definitive description of classical computer science, is now available in an attractive, boxed set. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work.  Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his &quot;cookbook&quot; solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.  <p>See descriptions of each individual volume for more information.</p>]]></description>
  <work>
  <best_book_id type="integer">363999</best_book_id>
  <books_count type="integer">2</books_count>
  <desc_user_id type="integer" nil="true"></desc_user_id>
  <id type="integer">354069</id>
  <media_type nil="true"></media_type>
  <original_language_id type="integer" nil="true"></original_language_id>
  <original_publication_day type="integer" nil="true"></original_publication_day>
  <original_publication_month type="integer" nil="true"></original_publication_month>
  <original_publication_year type="integer">1973</original_publication_year>
  <original_title>Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)</original_title>
  <rating_dist>total:25|5:16|4:5|3:4|2:0|1:0|</rating_dist>
  <ratings_count type="integer">25</ratings_count>
  <ratings_sum type="integer">112</ratings_sum>
  <reviews_count type="integer">68</reviews_count>
  <text_reviews_count type="integer">2</text_reviews_count>
</work>

  <average_rating><![CDATA[4.48]]></average_rating>
  <ratings_count><![CDATA[2]]></ratings_count>
  <text_reviews_count><![CDATA[1]]></text_reviews_count>
  
  <url><![CDATA[http://www.goodreads.com/book/show/2662710.Art_of_Computer_Programming_Sorting_and_Searching_]]></url>
  <link><![CDATA[http://www.goodreads.com/book/show/2662710.Art_of_Computer_Programming_Sorting_and_Searching_]]></link>
  <authors>
    <author>
    <id>64941</id>
        <name><![CDATA[Donald E. Knuth]]></name>
    <image_url><![CDATA[http://photo.goodreads.com/authors/1236845611p5/64941.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/authors/1236845611p2/64941.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/64941.Donald_E_Knuth]]></link>
    <average_rating>4.37</average_rating>
    <ratings_count>305</ratings_count>
    <text_reviews_count>49</text_reviews_count>
  </author>
  </authors>
    <reviews start="1" end="20" total="68">
      <review>
  <id>52390918</id>
    <user>
    <id>2197679</id>
    <name><![CDATA[v]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2197679-v]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1239228105p3/2197679.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1239228105p2/2197679.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">2662710</id>
  <isbn>020103803X</isbn>
  <isbn13>9780201038033</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming/Sorting and Searching. (Addison Wesley Series in Computer Science and Information Processing)]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/2662710.Art_of_Computer_Programming_Sorting_and_Searching_</link>
  <average_rating>4.00</average_rating>
  <ratings_count>2</ratings_count>
  <description>
    <![CDATA[Knuth's multivolume work, widely  recognized as the definitive description of classical computer science, is now available in an attractive, boxed set. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work.  Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his &quot;cookbook&quot; solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.  <p>See descriptions of each individual volume for more information.</p>]]>
  </description>
  <published>1973</published>
</book>

    <rating>3</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
            <shelf name="science" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sun Apr 12 10:34:13 -0700 2009</date_added>
  <date_updated>Sun Apr 12 10:34:36 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[N.B. I skipped around this volume.<br/>]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/52390918]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/52390918]]></link>
</review>
      <review>
  <id>1928000</id>
    <user>
    <id>124810</id>
    <name><![CDATA[Jeffrey]]></name>
    <location><![CDATA[Plano, TX]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/124810-jeffrey]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.52</average_rating>
  <ratings_count>23</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at>Fri Jan 01 00:00:00 -0800 1999</read_at>
  <date_added>Wed Jun 13 11:48:40 -0700 2007</date_added>
  <date_updated>Wed Jun 13 11:48:40 -0700 2007</date_updated>
  <read_count></read_count>
    <body><![CDATA[I haven't read this through, but I have used it is a reference.]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/1928000]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/1928000]]></link>
</review>
      <review>
  <id>81588644</id>
    <user>
    <id>3061045</id>
    <name><![CDATA[Stefan]]></name>
    <location><![CDATA[Varna, Bulgaria]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/3061045-stefan]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sun Dec 20 14:31:56 -0800 2009</date_added>
  <date_updated>Sun Dec 20 14:31:56 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/81588644]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/81588644]]></link>
</review>
      <review>
  <id>78298697</id>
    <user>
    <id>2953838</id>
    <name><![CDATA[Nick]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2953838-nick-loadholtes]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1260393786p3/2953838.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1260393786p2/2953838.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Nov 19 05:09:50 -0800 2009</date_added>
  <date_updated>Thu Nov 19 05:09:50 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/78298697]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/78298697]]></link>
</review>
      <review>
  <id>78031719</id>
    <user>
    <id>2951579</id>
    <name><![CDATA[Steve]]></name>
    <location><![CDATA[San Jose, CA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2951579-steve-ulrich]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Mon Nov 16 19:41:47 -0800 2009</date_added>
  <date_updated>Mon Nov 16 19:41:47 -0800 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/78031719]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/78031719]]></link>
</review>
      <review>
  <id>76254301</id>
    <user>
    <id>2892007</id>
    <name><![CDATA[Martin]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2892007-martin-remy]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>5</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Fri Oct 30 17:26:04 -0700 2009</date_added>
  <date_updated>Fri Oct 30 17:26:04 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/76254301]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/76254301]]></link>
</review>
      <review>
  <id>75484112</id>
    <user>
    <id>2867944</id>
    <name><![CDATA[Kelly]]></name>
    <location><![CDATA[Kearney, MO]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2867944-kelly]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1256247083p3/2867944.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1256247083p2/2867944.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Fri Oct 23 08:48:26 -0700 2009</date_added>
  <date_updated>Fri Oct 23 08:48:26 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/75484112]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/75484112]]></link>
</review>
      <review>
  <id>75359311</id>
    <user>
    <id>2866523</id>
    <name><![CDATA[Enrico]]></name>
    <location><![CDATA[]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2866523-enrico]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>5</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Oct 22 06:58:35 -0700 2009</date_added>
  <date_updated>Thu Oct 22 06:58:35 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/75359311]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/75359311]]></link>
</review>
      <review>
  <id>74617989</id>
    <user>
    <id>2781034</id>
    <name><![CDATA[David]]></name>
    <location><![CDATA[Irvine, CA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2781034-david]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1255526512p3/2781034.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1255526512p2/2781034.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>3</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Oct 15 08:54:41 -0700 2009</date_added>
  <date_updated>Thu Oct 15 08:54:41 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/74617989]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/74617989]]></link>
</review>
      <review>
  <id>74553547</id>
    <user>
    <id>1019482</id>
    <name><![CDATA[Truck]]></name>
    <location><![CDATA[The United States]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1019482-truck-smith]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Wed Oct 14 16:11:22 -0700 2009</date_added>
  <date_updated>Wed Oct 14 16:11:22 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/74553547]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/74553547]]></link>
</review>
      <review>
  <id>72670881</id>
    <user>
    <id>2781468</id>
    <name><![CDATA[Colonel32]]></name>
    <location><![CDATA[Oxford, 27, The United Kingdom]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2781468-colonel32]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>3</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sun Sep 27 12:22:31 -0700 2009</date_added>
  <date_updated>Sun Sep 27 12:22:31 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/72670881]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/72670881]]></link>
</review>
      <review>
  <id>69898692</id>
    <user>
    <id>1039508</id>
    <name><![CDATA[Daniel]]></name>
    <location><![CDATA[France]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1039508-daniel-holmlund]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>5</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Sep 03 00:32:58 -0700 2009</date_added>
  <date_updated>Thu Sep 03 00:32:58 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/69898692]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/69898692]]></link>
</review>
      <review>
  <id>69743959</id>
    <user>
    <id>1887332</id>
    <name><![CDATA[Andrew]]></name>
    <location><![CDATA[Wayne, PA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1887332-andrew]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1231529448p3/1887332.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1231529448p2/1887332.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Sep 01 17:38:59 -0700 2009</date_added>
  <date_updated>Tue Sep 01 17:38:59 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/69743959]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/69743959]]></link>
</review>
      <review>
  <id>69049303</id>
    <user>
    <id>2671579</id>
    <name><![CDATA[Krait]]></name>
    <location><![CDATA[Manly, 02, Australia]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2671579-krait]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1251336538p3/2671579.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1251336538p2/2671579.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>5</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
            <shelf name="computers" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Wed Aug 26 22:10:40 -0700 2009</date_added>
  <date_updated>Wed Aug 26 22:10:40 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/69049303]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/69049303]]></link>
</review>
      <review>
  <id>65168259</id>
    <user>
    <id>2565464</id>
    <name><![CDATA[Brad]]></name>
    <location><![CDATA[Saint Paul, MN]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2565464-brad]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Mon Jul 27 14:23:22 -0700 2009</date_added>
  <date_updated>Mon Jul 27 14:23:22 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/65168259]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/65168259]]></link>
</review>
      <review>
  <id>64670752</id>
    <user>
    <id>2553522</id>
    <name><![CDATA[Bill]]></name>
    <location><![CDATA[Cambridge, MA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2553522-bill-galen]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-M-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">2662710</id>
  <isbn>020103803X</isbn>
  <isbn13>9780201038033</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming/Sorting and Searching. (Addison Wesley Series in Computer Science and Information Processing)]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/2662710.Art_of_Computer_Programming_Sorting_and_Searching_</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[Knuth's multivolume work, widely  recognized as the definitive description of classical computer science, is now available in an attractive, boxed set. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work.  Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his &quot;cookbook&quot; solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.  <p>See descriptions of each individual volume for more information.</p>]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Jul 23 11:54:47 -0700 2009</date_added>
  <date_updated>Thu Jul 23 11:54:47 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/64670752]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/64670752]]></link>
</review>
      <review>
  <id>62002272</id>
    <user>
    <id>2484288</id>
    <name><![CDATA[Xiachenfeng]]></name>
    <location><![CDATA[Beijing, 22, China]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2484288-xiachenfeng]]></link>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-111x148.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto-U-50x66.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>5</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Fri Jul 03 05:22:54 -0700 2009</date_added>
  <date_updated>Fri Jul 03 05:22:54 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/62002272]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/62002272]]></link>
</review>
      <review>
  <id>60443621</id>
    <user>
    <id>1925260</id>
    <name><![CDATA[Leonardo]]></name>
    <location><![CDATA[Goiânia, Brazil]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1925260-leonardo]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1244373295p3/1925260.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1244373295p2/1925260.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
            <shelf name="to-read" />
      </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Sat Jun 20 15:05:04 -0700 2009</date_added>
  <date_updated>Sat Jun 20 15:05:04 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/60443621]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/60443621]]></link>
</review>
      <review>
  <id>58504668</id>
    <user>
    <id>2385387</id>
    <name><![CDATA[Mark]]></name>
    <location><![CDATA[Seattle, WA]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/2385387-mark-atwood]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1244224010p3/2385387.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1244224010p2/2385387.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">2662710</id>
  <isbn>020103803X</isbn>
  <isbn13>9780201038033</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming/Sorting and Searching. (Addison Wesley Series in Computer Science and Information Processing)]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/2662710.Art_of_Computer_Programming_Sorting_and_Searching_</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[Knuth's multivolume work, widely  recognized as the definitive description of classical computer science, is now available in an attractive, boxed set. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work.  Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his &quot;cookbook&quot; solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.  <p>See descriptions of each individual volume for more information.</p>]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Thu Jun 04 22:30:52 -0700 2009</date_added>
  <date_updated>Thu Jun 04 22:30:52 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/58504668]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/58504668]]></link>
</review>
      <review>
  <id>58237272</id>
    <user>
    <id>1979595</id>
    <name><![CDATA[Carol]]></name>
    <location><![CDATA[Kamuela, HI]]></location>
    <link><![CDATA[http://www.goodreads.com/user/show/1979595-carol]]></link>
    <image_url><![CDATA[http://photo.goodreads.com/users/1233448492p3/1979595.jpg]]></image_url>
    <small_image_url><![CDATA[http://photo.goodreads.com/users/1233448492p2/1979595.jpg]]></small_image_url>
  </user>
    <book>
  <id type="integer">363999</id>
  <isbn>0201896850</isbn>
  <isbn13>9780201896855</isbn13>
  <text_reviews_count type="integer">1</text_reviews_count>
  <title>
    <![CDATA[Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1174119828m/363999.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1174119828s/363999.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/363999.Art_of_Computer_Programming_Volume_3_Sorting_and_Searching</link>
  <average_rating>4.48</average_rating>
  <ratings_count>25</ratings_count>
  <description>
    <![CDATA[The first revision of this third volume is the most  comprehensive survey of classical computer techniques for sorting and  searching. It extends the treatment of data structures in Volume 1 to  consider both large and small databases and internal and external  memories. The book contains a selection of carefully checked computer  methods, with a quantitative analysis of their efficiency. Outstanding  features of the second edition include a revised section on optimum  sorting and new discussions of the theory of permutations and of  universal hashing.]]>
  </description>
  <published>1973</published>
</book>

    <rating>0</rating>
  <votes>0</votes>
  <spoiler_flag>false</spoiler_flag>
  <shelves>
        <shelf name="read" />
          </shelves>
  <recommended_for><![CDATA[]]></recommended_for>
  <recommended_by><![CDATA[]]></recommended_by>
  <read_at></read_at>
  <date_added>Tue Jun 02 17:36:25 -0700 2009</date_added>
  <date_updated>Tue Jun 02 17:36:25 -0700 2009</date_updated>
  <read_count></read_count>
    <body><![CDATA[]]></body>
    
  <url><![CDATA[http://www.goodreads.com/review/show/58237272]]></url>
  <link><![CDATA[http://www.goodreads.com/review/show/58237272]]></link>
</review>
    </reviews>
  <popular_shelves>
          <shelf name="to-read" />
          <shelf name="programming" />
          <shelf name="currently-reading" />
          <shelf name="computer-science" />
          <shelf name="technical" />
          <shelf name="computers" />
          <shelf name="reference" />
          <shelf name="may-never-read" />
          <shelf name="home" />
      </popular_shelves>
  <book_links>
    <book_link>
  <id>8</id>
  <name><![CDATA[WorldCat]]></name>
  <link>http://www.goodreads.com/book_link/follow/8?book_id=2662710</link>
</book_link>
  </book_links>
</book>
</GoodreadsResponse>