List Price: $85.00Amazon.com's Price: $58.90 You Save: $26.10 (31%)Prices subject to change.
Availability: Usually ships in 24 hours
Binding: Hardcover
Dewey Decimal Number: 005.1
EAN: 9780262032933
ISBN: 0262032937
Label: The MIT Press
Manufacturer: The MIT Press
Number Of Items: 1
Number Of Pages: 1184
Publication Date: September 01, 2001
Publisher: The MIT Press
Sales Rank: 5515
Studio: The MIT Press
Related Items:
Editorial Review:
Customer Reviews
Average Rating: 
Rating:  - good condition
this book was kept up...no pages missing
was a great deal for me, it beats buyin the book for full price
Rating:  - Faily good timely delivery
I received the book in a fairly good amount of time. I will just note that this book did not come with it's companion CD. I expected it to have it's companion cd. There was not mention as to whether or not the book had it's companion cd.
Rating: - The best textbook on algorithms, but it is not a programming book.
I used this book for a graduate level Algorithms course, and I really liked it. It is packed full of content on a wide range of topics. While this book does provide some high-level implementations of algorithms in pseudo-code, you will not find any examples of how to program algorithms in this book. That's really not what this book is meant for anyways.
I found the reading to be easier than Knuth on similar topics, but you still need to have sufficient mathematical background in order ... Read More
Rating: - This version has NO CD
There are three versions of the second edition, only one of which has the CD:
The first one is published by the MIT Press, with the title "Introduction to Algorithms". This one has no CD. This is the one Amazon currently carries, so if you buy from Amazon, you get no CD.
The second one is published by McGraw-Hill, also with the title "Introduction to Algorithms". This one also has no CD.
The third one is published by McGraw-Hill too, but has the title "Introduction ... Read More
Rating: - excellent resource
This book is (in my opinion) an essential resource of common computer science algorithms. It covers a broad range of different algorithm topics and I found the explanations by the authors extremely helpful and simple to understand (both with simple and advanced topics). It does attempt to cover as many algorithm topics as possible, so some topics may not be covered in fine detail (it does not spend as much time on runtime analysis as other books, or spend much time on NP problems). It is perfect for someone ... Read More
|
