Introduction to Algorithms
by Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, CliffordFormat: Hardcover
Pub. Date: 2001-07-16
Publisher(s): McGraw-Hill Science/Engineering/Math
Other versions by this Author
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
List Price: $152.46
Buy New
Arriving Soon. Will ship when available.
$145.20
Rent Textbook
Select for Price
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.
Table of Contents
PrefaceI Foundations1 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 Statistics6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order StatisticsIII Data Structures 10 Elementary Data Structures 11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
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 Statistics6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order StatisticsIII Data Structures 10 Elementary Data Structures 11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
3 Growth of Functions 4 Recurrences 5 Probabilistic Analysis and Randomized Algorithms II Sorting and Order Statistics6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order StatisticsIII Data Structures 10 Elementary Data Structures 11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
5 Probabilistic Analysis and Randomized Algorithms II Sorting and Order Statistics6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order StatisticsIII Data Structures 10 Elementary Data Structures 11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order StatisticsIII Data Structures 10 Elementary Data Structures 11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
8 Sorting in Linear Time 9 Medians and Order StatisticsIII Data Structures 10 Elementary Data Structures 11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
III Data Structures 10 Elementary Data Structures 11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
11 Hash Table12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
IV Advanced Design and Analysis Techniques15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
V Advanced Data Structures18 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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
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 Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
22 Elementary Graph Algorithms 23 Minimum Spanning Trees 24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow VII Selected Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow VII Selected Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
26 Maximum Flow VII Selected Topics27 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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
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 VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
35 Approximation Algorithms VIII Appendix: Mathematical BackgroundA Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
A Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
C Counting and Probability Bibliography Index (created by the authors)
Index (created by the authors)
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.