• Sign In
  • My Cart 0)
main product photo

Algorithms

1st Edition
0073523402 · 9780073523408
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 mathematica… Read More
Add to Wish List
Currently without stock
£44.24
Request More Info

Receive via shipping:

  • Colour, print bound version of the complete text

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

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

Sprinkled with interesting stories about the development of important algorithms as well as about their current uses in the global information environment.
The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solveD and show how to develop the algorithm...
Self contained chapters that provide a variety of perspectives on the implementation of algorithms The authors cover THE essential algorithms that students need to know, but are also thorough and rigorous; including coverage of linear programming and quantum computing (BOTH optional, BUT COVERED IN NO OTHER BOOK).
The book uses a unique approach for proofs and is intuitive and accessible.