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.


Look around you. Computers and networks are everywhere, enabling an intricate web of complex human activities: education, commerce, entertainment, research, manufacturing, health management, human communication, even war. Of the two main technological underpinnings of this amazing proliferation, one is obvious: the breathtaking pace with which advances in microelectronics and chip design have been bringing us faster and faster hardware. This book tells the story of the other intellectual enterprise that is crucially fueling the computer revolution: efficient algorithms. It is a fascinating story.

Table of Contents

  • Algorithms with numbers
  • Divide-and-conquer algorithms
  • Decompositions of graphs
  • Paths in graphs
  • Greedy algorithms
  • Dynamic programming
  • Linear programming
  • NP-complete problems
  • Coping with NP-completeness
  • Quantum algorithms

Book Details

Author(s): S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani.
Publisher: McGraw-Hill Science/Engineering/Math
Format(s): PDF
File size: 1.97 MB
Number of pages: 336
Link: Download.

Leave a Reply