<?xml version="1.0" encoding="UTF-8"?><ItemLookupResponse xmlns="http://webservices.amazon.com/AWSECommerceService/2005-10-05"><OperationRequest><HTTPHeaders><Header Name="UserAgent"></Header></HTTPHeaders><RequestId>0VJKXXA5WVQMF20Y10NY</RequestId><Arguments><Argument Name="ResponseGroup" Value="Medium,OfferFull"></Argument><Argument Name="Operation" Value="ItemLookup"></Argument><Argument Name="Service" Value="AWSECommerceService"></Argument><Argument Name="AWSAccessKeyId" Value="02NDPFGZ9A35HRBQ9NG2"></Argument><Argument Name="ItemId" Value="0262531968"></Argument><Argument Name="IdType" Value="ASIN"></Argument></Arguments><RequestProcessingTime>0.0677950382232666</RequestProcessingTime></OperationRequest><Items><Request><IsValid>True</IsValid><ItemLookupRequest><IdType>ASIN</IdType><ItemId>0262531968</ItemId><ResponseGroup>OfferFull</ResponseGroup><ResponseGroup>Medium</ResponseGroup></ItemLookupRequest></Request><Item><ASIN>0262531968</ASIN><DetailPageURL>http://www.amazon.com/gp/redirect.html%3FASIN=0262531968%26tag=ws%26lcode=xm2%26cID=2025%26ccmID=165953%26location=/o/ASIN/0262531968%253FSubscriptionId=02NDPFGZ9A35HRBQ9NG2</DetailPageURL><SalesRank>186764</SalesRank><SmallImage><URL>http://images.amazon.com/images/P/0262531968.01._SCTHUMBZZZ_.jpg</URL><Height Units="pixels">60</Height><Width Units="pixels">51</Width></SmallImage><MediumImage><URL>http://images.amazon.com/images/P/0262531968.01._SCMZZZZZZZ_.jpg</URL><Height Units="pixels">140</Height><Width Units="pixels">119</Width></MediumImage><LargeImage><URL>http://images.amazon.com/images/P/0262531968.01._SCLZZZZZZZ_.jpg</URL><Height Units="pixels">475</Height><Width Units="pixels">403</Width></LargeImage><ImageSets><ImageSet Category="primary"><SmallImage><URL>http://images.amazon.com/images/P/0262531968.01._SCTHUMBZZZ_.jpg</URL><Height Units="pixels">60</Height><Width Units="pixels">51</Width></SmallImage><MediumImage><URL>http://images.amazon.com/images/P/0262531968.01._SCMZZZZZZZ_.jpg</URL><Height Units="pixels">140</Height><Width Units="pixels">119</Width></MediumImage><LargeImage><URL>http://images.amazon.com/images/P/0262531968.01._SCLZZZZZZZ_.jpg</URL><Height Units="pixels">475</Height><Width Units="pixels">403</Width></LargeImage></ImageSet></ImageSets><ItemAttributes><Author>Thomas H. Cormen</Author><Author>Charles E. Leiserson</Author><Author>Ronald L. Rivest</Author><Author>Clifford Stein</Author><Binding>Paperback</Binding><Brand>MIT Press</Brand><DeweyDecimalNumber>004</DeweyDecimalNumber><EAN>9780262531962</EAN><Edition>2</Edition><ISBN>0262531968</ISBN><ItemDimensions><Height Units="hundredths-inches">950</Height><Length Units="hundredths-inches">0</Length><Weight Units="hundredths-pounds">470</Weight><Width Units="hundredths-inches">750</Width></ItemDimensions><Label>The MIT Press</Label><ListPrice><Amount>5800</Amount><CurrencyCode>USD</CurrencyCode><FormattedPrice>$58.00</FormattedPrice></ListPrice><Manufacturer>The MIT Press</Manufacturer><NumberOfItems>1</NumberOfItems><NumberOfPages>1184</NumberOfPages><PackageDimensions><Height Units="hundredths-inches">185</Height><Length Units="hundredths-inches">909</Length><Weight Units="hundredths-pounds">418</Weight><Width Units="hundredths-inches">799</Width></PackageDimensions><ProductGroup>Book</ProductGroup><PublicationDate>2001-09-01</PublicationDate><Publisher>The MIT Press</Publisher><Studio>The MIT Press</Studio><Title>Introduction to Algorithms, Second Edition</Title></ItemAttributes><OfferSummary><LowestNewPrice><Amount>5894</Amount><CurrencyCode>USD</CurrencyCode><FormattedPrice>$58.94</FormattedPrice></LowestNewPrice><LowestUsedPrice><Amount>5500</Amount><CurrencyCode>USD</CurrencyCode><FormattedPrice>$55.00</FormattedPrice></LowestUsedPrice><LowestCollectiblePrice><Amount>6699</Amount><CurrencyCode>USD</CurrencyCode><FormattedPrice>$66.99</FormattedPrice></LowestCollectiblePrice><TotalNew>11</TotalNew><TotalUsed>4</TotalUsed><TotalCollectible>1</TotalCollectible><TotalRefurbished>0</TotalRefurbished></OfferSummary><Offers><TotalOffers>0</TotalOffers><TotalOfferPages>0</TotalOfferPages></Offers><EditorialReviews><EditorialReview><Source>Amazon.com</Source><Content>Aimed at any serious programmer or computer science student,  the new second edition of &lt;I&gt;Introduction to Algorithms&lt;/I&gt; builds on  the tradition of the original with a truly magisterial guide to the  world of algorithms. Clearly presented, mathematically rigorous, and  yet approachable even for the math-averse, this title sets a high  standard for a textbook and reference to the best algorithms for  solving a wide range of computing problems.&lt;p&gt;With sample problems and  mathematical proofs demonstrating the correctness of each algorithm,  this book is ideal as a textbook for classroom study, but its reach  doesn't end there. The authors do a fine job of explaining each  algorithm. (Reference sections on basic mathematical notation will help  readers bridge the gap, but it will help to have some math background  to appreciate the full achievement of this handsome hardcover volume.)  Every algorithm is presented in pseudo-code, which can be implemented  in any computer language, including C/C++ and Java. This ecumenical  approach is one of the book's strengths. When it comes to sorting and  common data structures, from basic linked lists to trees (including  binary trees, red-black, and B-trees), this title really shines, with  clear diagrams that show algorithms in operation. Even if you just  glance over the mathematical notation here, you can definitely benefit  from this text in other ways.&lt;p&gt;The book moves forward with more  advanced algorithms that implement strategies for solving more  complicated problems (including dynamic programming techniques, greedy  algorithms, and amortized analysis). Algorithms for graphing problems  (used in such real-world business problems as optimizing flight  schedules or flow through pipelines) come next. In each case, the  authors provide the best from current research in each topic, along  with sample solutions.&lt;p&gt;This text closes with a grab bag of useful  algorithms including matrix operations and linear programming,  evaluating polynomials, and the well-known Fast Fourier Transformation  (FFT) (useful in signal processing and engineering). Final sections on  "NP-complete" problems, like the well-known traveling salesman problem,  show off that while not all problems have a demonstrably final and best  answer, algorithms that generate acceptable approximate solutions can  still be used to generate useful, real-world answers.&lt;p&gt;Throughout this  text, the authors anchor their discussion of algorithms with current  examples drawn from molecular biology (like the Human Genome Project),  business, and engineering. Each section ends with short discussions of  related historical material, often discussing original research in each  area of algorithms. On the whole, they argue successfully that  algorithms are a "technology" just like hardware and software that can  be used to write better software that does more, with better  performance. Along with classic books on algorithms (like Donald  Knuth's three-volume set, &lt;I&gt;The Art of Computer  Programming&lt;/I&gt;), this title sets a new standard for compiling the  best research in algorithms. For any experienced developer, regardless  of their chosen language, this text deserves a close look for extending  the range and performance of real-world software. &lt;I&gt;--Richard  Dragan&lt;/I&gt; &lt;p&gt; &lt;B&gt;Topics covered:&lt;/B&gt; Overview of algorithms (including algorithms as  a technology); designing and analyzing algorithms; asymptotic notation;  recurrences and recursion; probabilistic analysis and randomized  algorithms; heapsort algorithms; priority queues; quicksort algorithms;  linear time sorting (including radix and bucket sort); medians and  order statistics (including minimum and maximum); introduction to data  structures (stacks, queues, linked lists, and rooted trees); hash  tables (including hash functions); binary search trees; red-black  trees; augmenting data structures for custom applications; dynamic  programming explained (including assembly-line scheduling, matrix-chain  multiplication, and optimal binary search trees); greedy algorithms  (including Huffman codes and task-scheduling problems); amortized  analysis (the accounting and potential methods); advanced data  structures (including B-trees, binomial and Fibonacci heaps,  representing disjoint sets in data structures); graph algorithms  (representing graphs, minimum spanning trees, single-source shortest  paths, all-pairs shortest paths, and maximum flow algorithms); sorting  networks; matrix operations; linear programming (standard and slack  forms); polynomials and the Fast Fourier Transformation (FFT); number  theoretic algorithms (including greatest common divisor, modular  arithmetic, the Chinese remainder theorem, RSA public-key encryption,  primality testing, integer factorization); string matching;  computational geometry (including finding the convex hull);  NP-completeness (including sample real-world NP-complete problems and  their insolvability); approximation algorithms for NP-complete problems  (including the traveling salesman problem); reference sections for  summations and other mathematical notation, sets, relations, functions,  graphs and trees, as well as counting and probability backgrounder  (plus geometric and binomial distributions).</Content></EditorialReview><EditorialReview><Source>Book Description</Source><Content>&lt;b&gt;PLEASE NOTE: This is the international student paperback edition of this book. The MIT Press does not have sales rights for this paperback edition in the US and Canada. Customers in the US and Canada must order the hardcover edition. &lt;/b&gt;&lt;br /&gt; &lt;br /&gt; There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. &lt;i&gt;Introduction to Algorithms&lt;/i&gt; combines rigor and comprehensiveness.&lt;br /&gt; &lt;br /&gt; The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.&lt;br /&gt; &lt;br /&gt; The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.</Content></EditorialReview></EditorialReviews></Item></Items></ItemLookupResponse>