Computer Algorithms, 2/e (Paperback)

Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran




Latest Edition of the Classic Algorithms Text!
Brand new edition of the programming language-independent text that helped establish computer algorithms as discipline of computer science -- a thoroughly revised and updated edition. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education.
A major strength of this text is its focus on design techniques rather than on individual algorithms.

Computer Algorithms emphasizes:


  • Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
  • Examples: A wide range of examples provides students with the actual implementation of correct design.
  • The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
  • Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.

Computer Algorithms is appropriate as a core text for upper- and graduate-level analysis of algorithms courses.