Introduction to Algorithms

9780262033848

Introduction to Algorithms

  • ISBN 13:

    9780262033848

  • ISBN 10:

    0262033844

  • Edition: 3rd
  • Format: Hardcover
  • Copyright: 07/31/2009
  • Publisher: RANDOM HOUSE

List Price $128.00 Save

Rent $76.03
TERM PRICE DUE
Added Benefits of Renting

Free Shipping Both Ways Free Shipping Both Ways
Highlight/Take Notes Like You Own It Highlight/Take Notes Like You Own It
Purchase/Extend Before Due Date Purchase/Extend Before Due Date

List Price $128.00 Save $1.28

New $126.72

In Stock Usually Ships in 24 Hours.

We Buy This Book Back We Buy This Book Back!

Included with your book

Free Shipping On Every Order Free Shipping On Every Order

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Extend or Purchase Your Rental at Any Time

Need to keep your rental past your due date? At any time before your due date you can extend or purchase your rental through your account.

Summary

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. 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. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.

Author Biography

Read more