- Save 10% on selected children’s books, compliments of Amazon Family Promotion exclusive for Prime members .
Introduction to Algorithms Paperback – 20 Aug 2009
Special offers and product promotions
Frequently bought together
Customers who bought this item also bought
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.
If you are a seller for this product, would you like to suggest updates through seller support?
"In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. This beautifully written, thoughtfully organized book is the definitive introductory book on the design and analysis of algorithms. The first half offers an effective method to teach and study algorithms; the second half then engages more advanced readers and curious students with compelling material on both the possibilities and the challenges in this fascinating field."--Shang-Hua Teng, University of Southern California
""Introduction to Algorithms, " the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance."--Daniel Spielman, Department of Computer Science, Yale University
"As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference."--Gabriel Robins, Department of Computer Science, University of Virginia
About the Author
Thomas H. Cormen is Professor of Computer Science at Dartmouth College. Charles E. Leiserson is Professor of Computer Science and Engineering at MIT. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at MIT. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
What other items do customers buy after viewing this item?
Top customer reviews
As the title suggests, Introduction to Algorithms, which reached its third edition back in 2009, is a beginners text for anyone interested in learning the basics, be it a student at the first year of college or simply a curious enthusiast. Many experienced developers might also find the text quite useful to refresh some concept, since many job interviews are about implementing a variant of a known algorithm. The book spans some 1300 pages, which means that, unless you quickly rush from the front to the back cover, it will take quite some time to read it. The topics are grouped into seven sections, which range from basic concepts, such as divide and conquer and the O notation, up to NP completeness, passing through sorting, graphs and trees.
Each chapter follows a common pattern: first, an overview of the subject being covered is given; what follows is a detailed discussion of the key parts of that topic; and plenty of exercises, to practice what we just learned. What I find particularly interesting about this book is the abundance of clear and colorful diagrams which show, step by step, how a data structure changes through time. The algorithms are explained both theoretically and through pseudo code. The key points of each algorithm in the code are then explicitly referenced by the authors, when they present an example with real data, covering all the different (edge) cases that can happen. Detailed schemas support these explanation, giving the reader a step by step view of the data.
Tying it all up, a must have for every programmer. While there are many excellent texts out there covering the recent advances on specific subjects, Introduction to Algorithms is the one choice to get started.
As usual, you can find more reviews on my personal blog: http://books.lostinmalloc.com. Feel free to pass by and share your thoughts!
Who need this book
Programmer who want to optimize their algorithms or just want to brush up different algorithms which they use in their day to day programming.
Student who are learning Computer science at university, this book is must have for them.
Book is divided in following main sections
This section has 5 chapters and gives the basic idea about the algorithms and how to solve a problem using an algorithm and different approach about the algorithms.
Explain about the notation of algorithms and how to write a one.
Explain how to calculate the complexity of algorithms and along with the different notations such as big o etc.
2.Sorting and Order Statistics
This section is devoted to different sorting algorithms such as quick and heap etc, there are 4 chapters in total.
This section gives basic idea about the data structure before advance section; this section includes stack, link list, queue, hash table etc.
There are 5 chapters in total for basic data structures.
4.Advanced design and analysis technique
This section has 3 chapters and explains dynamic programming, greedy algorithms and amortized analysis.
5.Advance Data Structures
This section explains about B tree, Fibonacci heap, van Emde Boas tree and disjoint set.
This section explains about different graph algorithms such dijkstra and shortest path algorithms etc.
this section has some different topics such as multithreaded algorithms, matrix operation , string matching and pattern matching etc.
Point about book.
Book is well written and very concise.
Explain every algorithm in very details.
Most of the algorithms are covered in book along with the calculating the complexity of algorithms.
Doesn't follow any specific computer programming language syntax for algorithms so it's easy to follow for non-programmer.
Every chapters has some problem set at the end of the chapter and in between (answers are not provided in book but some solutions are there on book's website.)
There are lots of diagram in book for better explanation.
Most advance topics, those are not suitable for under graduate are marked with Star.
Book required some basic engineering mathematical understanding.
The only place I could really find for Van Embde trees which apparently are the latest thing.
Very (very) comprehensive and worth persevering with - given its formality.
Really a must for reference.