Your basket is currently empty
This text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. The features include: the use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. It includes carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. It gives an accessible treatment of linear programming and introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject.
US Edition Brand New books, Ship via USPS with Delivery confirmation, No APO/FPO addresses. 
Quality text from a reliable seller. Speedy service! Choose EXPEDITED for fastest shipping! 
Paperback. Almost new condition. Almost new condition. SKU: 24990867 All orders shipped within 1 business day. 14 day money back guarantee ISBN: 9780073523408. 
(336 pages) this text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. features include: the use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. an accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. an optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. 0 prologue 1 algorithms with numbers 2 divide-and-conquer algorithms 3 decompositions of graphs 4 paths in graphs 5 greedy algorithms 6 dynamic programming 7 linear programming and reductions 8 np-complete problems 9 coping with np-completeness 10 quantum algorithms (Paperback) 
Trade paperback (US). Glued binding. 320 p. Contains: Illustrations. 
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. ""Algorithms" is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read. " Tim Roughgarden Stanford University ISBN10: 0073523402. 
Trade paperback (US). Glued binding. 320 p. Contains: Illustrations. 