Introducing Algorithms

Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest

  • 4.35 out of 5 stars
    9,392 ratings by Goodreads
ISBN 10: 8120313534 ISBN 13: 9788120313538
Published by Prentice-Hall India, 2001
Used Paperback

From ThriftBooks-Dallas, Dallas, TX, U.S.A. Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since July 2, 2009

This specific item is no longer available.

About this Item

Description:

Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G8120313534I3N00

  • 4.35 out of 5 stars
    9,392 ratings by Goodreads

Report this item

Synopsis:

There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference. Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics. Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of the subject.

"About this title" may belong to another edition of this title.

Bibliographic Details

Title: Introducing Algorithms
Publisher: Prentice-Hall India
Publication Date: 2001
Binding: Paperback
Condition: Good
Dust Jacket Condition: No Jacket
Edition: 5th or later Edition

Top Search Results from the AbeBooks Marketplace