Introduction to Algorithms
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
List Price:
Our Price: $64.12
You Save: $22.88 (26%)
Availability: Usually ships in 24 hours
Buy Used: from $48.99 (click here)
Category: Book
See more book details and other editions
Book Summary Information
Author: Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. CormenEdition: Hardcover
Audio: English (Unknown); English (Original Language); English (Published)
Published: 2009-07-31
ISBN: 0262033844
Number of pages: 1312
Publisher: The MIT Press
Book Reviews of Introduction to Algorithms
Book Review: THE book for learning the theory and implementation of algorithms
Summary: 5 Stars
An algorithm is nothing more than a set of computational steps that transform a specific input into a desired output. From that definition, there are plenty of books on the market that are "cookbooks" of algorithms and will enable you to do just that - transform specific inputs into outputs, complete with source code, and with no real depth of understanding of your own required. However, to be a computer scientist versus a programmer, you need to know what makes an efficient algorithm, why is a particular algorithm efficient, what kinds of common data structures are involved in various computing problems, how to traverse those data structures efficiently, and a notation for analyzing various algorithms. This book will help you learn all of that. The study of the theory of algorithms is not to be undertaken lightly, and I don't recommend you attempt to self-study such a complex subject with such strong mathematical underpinnings. In fact, this book is really aimed at graduate computer science students and is often on the reading list of Ph.D. qualifying examinations in that field.
For students of graph theory, you might find your knowledge solidly supplemented by the material in chapters 22 through 26 on graph algorithms. The last section of the book, "Selected Topics", goes over various specific algorithms from many fields using the knowledge of algorithm design and analysis you have learned up to this point in the book. Throughout, the text is very clear, and there are plenty of instructive diagrams and pseudocode.
One of the most interesting parts of the book is the chapter on NP-completeness. This is the study of problems for which no efficient algorithm has ever been found. These problems are interesting for two reasons. The first being that even though an efficient algorithm has never been found, there is no proof that one cannot exist. Second, if an efficient algorithm exists for one of them, then an efficient algorithm exists for all. Thus, if you are ever called upon to write an efficient algorithm for an NP-complete problem, you will be involved in a long fruitless search if you do not recognize the problem as NP-complete. If you can show the problem is NP-complete, you can go about producing an algorithm that gives a good solution, but not the best possible solution. This kind of knowledge is what separates a computer scientist from a mere programmer, and is one of many reasons to study this book's contents. I highly recommend this book to anyone who truly wants to be called a computer scientist.
To get the most from this book you should already be familiar with discrete mathematics and combinatorics, as this book makes heavy use of these subjects. Because this book contains no solutions to any of the exercises, might I suggest "Problems on Algorithms" by Ian Parberry as a companion to this book. It has a little bit of tutorial and a lot of exercises, many unsolved, but some with hints and others with solutions. Also, for more basic material, you might look at "Schaum's Outline of Discrete Mathematics". It's very inexpensive and can almost stand alone as a tutorial on the mathematics you need to know to succeed at understanding this book. The table of contents is not shown for this third edition of the book, so I supply that information next:
Table of Contents
Preface
I Foundations
1 The Role of Algorithms in Computing
2 Getting Started
3 Growth of Functions
4 Recurrences
5 Probabilistic Analysis and Randomized Algorithms
II Sorting and Order Statistics
6 Heapsort
7 Quicksort
8 Sorting in Linear Time
9 Medians and Order Statistics
III Data Structures
10 Elementary Data Structures
11 Hash Table
12 Binary Search Trees
13 Red-Black Trees
14 Augmenting Data Structures
IV Advanced Design and Analysis Techniques
15 Dynamic Programming
16 Greedy Algorithms
17 Amortized Analysis
V Advanced Data Structures
18 B-Trees
19 Binomial Heaps
20 Fibonacci Heaps
21 Data Structures for Disjoint Sets
VI Graph Algorithms
22 Elementary Graph Algorithms
23 Minimum Spanning Trees
24 Single-Source Shortest Paths
25 All-Pairs Shortest Paths
26 Maximum Flow
VII Selected Topics
27 Sorting Networks
28 Matrix Operations
29 Linear Programming
30 Polynomials and the FFT
31 Number-Theoretic Algorithms
32 String Matching
33 Computational Geometry
34 NP Completeness
35 Approximation Algorithms
Summary of Introduction to Algorithms
"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
(Daniel Spielman )Computer Science Books
Book Subjects
- Arts & Photography
- Biographies & Memoirs
- Business & Investing
- Children's Books
- Comics & Graphic Novels
- Computers & Internet
- Cooking, Food & Wine
- Entertainment
- Gay & Lesbian
- Health, Mind & Body
- History
- Home & Garden
- Horror
- Law
- Literature & Fiction
- Mystery & Thrillers
- Nonfiction
- Outdoors & Nature
- Parenting & Families
- Professional & Technical
- Reference
- Religion & Spirituality
- Romance
- Science
- Science Fiction & Fantasy
- Sports
- Teens
- Travel
Most talked about in Computer Science Books
The Unofficial Guide to Surviving Y2K (Unofficial Guides)by Laura Harrision McBride
Wiley; Published: 1999-09-15; Paperback; Book
Best price: $240.62
Systems Analysis: Definition, Process and Designby Philip C. Semprevivo
Sra; Published: 1982-07; Hardcover; Book
Price in other shops:
FORTRAN 77 and Numerical Methods for Engineers and Scientistsby Larry Nyhoff, Sanford Leestma
Macmillan Pub Co; Published: 1995-04-20; Textbook Binding; Book
Best price: $240.88
Design and Development of Expert Systems and Neural Networksby Larry Medsker, Jay Liebowitz
Prentice Hall; Published: 1993-10-04; Hardcover; Book
Best price: $42.75
Price in other shops:
Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win (Outlooks)by Steven Skiena
Cambridge University Press; Published: 2001-08-06; Paperback; Book
Best price: $16.99
Price in other shops:
The Jazzby Melissa Scott
Tor Books; Published: 2000-06-03; Hardcover; Book
Best price: $2.95
Price in other shops:
B2B Application Integration: e-Business-Enable Your Enterpriseby David S. Linthicum
Addison-Wesley Professional; Published: 2000-12-15; Paperback; Book
Best price: $2.06
Price in other shops:
Conceptual Spaces: The Geometry of Thoughtby Peter Gärdenfors
The MIT Press; Published: 2000-03-20; Hardcover; Book
Best price: $34.99
Price in other shops:
Autonomic Computingby Richard Murch
IBM Press; Published: 2004-04-03; Hardcover; Book
Best price: $10.50
Price in other shops:
Advanced Digital Design with the Verilog HDL (2nd Edition)by Michael D. Ciletti
Prentice Hall; Published: 2010-01-31; Hardcover; Book
Best price: $100.00
Price in other shops:
Similar Books and other products
Computer Architecture, Fifth Edition: A Quantitative Approach (The Morgan Kaufmann Series in Computer Architecture and Design)by John L. Hennessy, David A. Patterson
Morgan Kaufmann; Published: 2011-09-30; Paperback; Book
Best price: $45.00
Price in other shops:
Algorithmsby Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
McGraw-Hill Science/Engineering/Math; Published: 2006-09-13; Paperback; Book
Best price: $32.07
Computer Systems: A Programmer's Perspective (2nd Edition)by Randal E. Bryant, David R. O'Hallaron
Addison Wesley; Published: 2010-02-14; Hardcover; Book
Best price: $87.77
Price in other shops:
Programming Pearls (2nd Edition)by Jon Bentley
Addison-Wesley Professional; Published: 1999-10-07; Paperback; Book
Best price: $24.92
Price in other shops:
Algorithm Designby Jon Kleinberg, Éva Tardos
Addison Wesley; Published: 2005-03-26; Hardcover; Book
Best price: $97.96
Price in other shops:
Software Engineering: A Practitioner's Approachby Roger Pressman
McGraw-Hill Science/Engineering/Math; Published: 2009-01-20; Hardcover; Book
Best price: $87.99
Introduction to the Theory of Computationby Michael Sipser
Course Technology; Published: 2005-02-15; Hardcover; Book
Best price: $110.00
Price in other shops:
Artificial Intelligence: A Modern Approach (3rd Edition)by Stuart Russell, Peter Norvig
Prentice Hall; Published: 2009-12-11; Hardcover; Book
Best price: $101.00
Price in other shops:
The Algorithm Design Manualby Steven S. Skiena
Springer; Published: 2008-07-26; Hardcover; Book
Best price: $52.00
Price in other shops:
Cracking the Coding Interview: 150 Programming Questions and Solutionsby Gayle Laakmann McDowell
CareerCup; Published: 2011-08-22; Paperback; Book
Best price: $29.93
Price in other shops: