- Paperback: 336 pages
- Publisher: McGraw-Hill Education; 1 edition (September 13, 2006)
- Language: English
- ISBN-10: 0073523402
- ISBN-13: 978-0073523408
- Product Dimensions: 7.3 x 0.5 x 9.2 inches
- Shipping Weight: 1 pounds (View shipping rates and policies)
- Average Customer Review: 3.8 out of 5 stars See all reviews (59 customer reviews)
- Amazon Best Sellers Rank: #47,334 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Algorithms 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
Frequently bought together
Customers who bought this item also bought
If you are a seller for this product, would you like to suggest updates through seller support?
Top Customer Reviews
Algorithms was the assigned text in a class here at UC Berkeley, and I feel I would have been very confused if I did not have CLRS to cross-reference and explain things more clearly, and in more detail.
This text isn't bad, per se, but there are definitely better options. I've taken the class with Christos Papadimitriou, and even he has said that everyone should own CLRS. Given that, I'm not sure what purpose this text serves. Is brevity actually better if you end up spending more time trying to understand things?
Why do I so conclude? Let's distinguish between so called computer science students doing more nuts and bolts and technical studies who typically learn Java then C++ and sometimes take an assembler subject, and information systems students who typically learn Java and then systems analysis and design and database and sometimes never even take a low level programming subject. The former would in my opinion be well served by this work; the latter might find the mathematical content perhaps a bit challenging.
That said, the first year computer science student should realise that algorithms is a deep subject that leads in many surprising directions deep into many fields of mathematics, and that one could spend years studying just the history of algorithms ... Therefore, this is a reference work to be dipped into to find the content that is needed by the task at hand. The use of the table of contents and index to find such content as is relevant to the task at hand is required. But, during the break before second year read this work cover to cover, as there is so much knowledge to absorb as one learns to appreciate the many and varied algorithms available to solve various problems and begin to acquire judgment as to what kind of algorithm would suit a particular problem situation with its time and space and cost constraints ... including the cost if required to code it up and carefully and properly test it!
An educational textbook well suited to that purpose; but not recommended for the professional reference library market.