| Welcome to vBulletin FAQ |
vBulletin FAQ Navigation
Getting Started
Customizing your vBulletin
Search Engines & SEO
Making Money with a Forum
Promoting your Community
|
| Get your own vBulletin Today |
|
| Webmaster Help |
|
|
|
Introduction to Algorithms
vBulletin Book Store > vBulletin books beginning with I
|
Introduction to Algorithms |
Author: Thomas H. Cormen
Published: 2001-09-01 |
List price: $85.00
Our price: $58.90
|
Usually ships in 24 hours
As of: December 02nd, 2008 09:28:19 PM
|
|
|
Customer comments on this selection.
 good condition
this book was kept up...no pages missing
br /was a great deal for me, it beats buyin the book for full price
 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.
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.
br /
br /I found the reading to be easier than Knuth on similar topics, but you still need to have sufficient mathematical background in order to keep up (statistics, discrete math, some calculus). Also, unlike many technical books I've read recently, I did not find any mistakes, not even a typo.
br /
br /Some people are not aware that the MIT Open Courseware website has some excellent free video course lectures that use this book. I highly recommend at least viewing the first three or four of those lectures if you are new to this topic because they compliment this book very well. Make sure you understand the first four chapters of this book before moving on to other topics.
br /
br /Also, since it had been a while since I had the math as an undergraduate, I was relieved to learn that this book had several appendices that provided a review of the math topics required by the book.
br /
br /The only negative about the book is that it does not provide answers to any of the exercises at the end of the chapters, so you really need to use this book in conjunction with a course in order to be able to check your progress and how well you are learning the information. If you're not using this book with a course, check the MIT Open Courseware website that I mentioned previously. It has some sample assignments you can use.
 This version has NO CD
There are three versions of the second edition, only one of which has the CD:
br /
br /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.
br /
br /The second one is published by McGraw-Hill, also with the title "Introduction to Algorithms". This one also has no CD.
br /
br /The third one is published by McGraw-Hill too, but has the title "Introduction to Algorithms and Java CD-ROM". This is the one with the CD. It's much more expensive than the other two.
br /
br /The CD in the third version contains implementations of the algorithms in Java.
br /
br /To find someone that carries the CD version, search for this ISBN-13 number: 9780072970548 , or for "Introduction to Algorithms and Java CD-ROM" .
br /
br /Note: Some listings that come up for the ISBN number will not be the correct version. Look carefully for "and Java CD-ROM" before buying.
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 taking an algorithms class (grad or undergrad), or someone looking to broaden their algorithm knowledge. I only wish there was some form of solutions guide to help verify answers to review questions.
|
|
Our vBulletin book picks:
|
|
Find more vBulletin related products of interest.
|
