Introduction to Algorithms

Name: Introduction to Algorithms
Price: 7.8 USD
Availability: InStock
ISBN: 9780070131439

ISBN-10: 0070131430

ISBN-13: 9780070131439

Edition: 1990

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

List price: $80.63

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $7.80

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

Book details

List price: $80.63
Copyright year: 1990
Publisher: McGraw-Hill Higher Education
Binding: Hardcover
Pages: 768
Size: 8.24" wide x 10.28" long x 1.90" tall
Weight: 5.280

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.



Preface


Foundations


Introduction


The Role of Algorithms in Computing


Getting Started


Growth of Functions


Recurrences


Probabilistic Analysis and Randomized Algorithms


Sorting and Order Statistics


Introduction


Heapsort


Quicksort


Sorting in Linear Time


Medians and Order Statistics


Data Structures


Introduction


Elementary Data Structures


Hash Tables


Binary Search Trees


Red-Black Trees


Augmenting Data Structures


Advanced Design and Analysis Techniques


Introduction


Dynamic Programming


Greedy Algorithms


Amortized Analysis


Advanced Data Structures


Introduction


B-Trees


Binomial Heaps


Fibonacci Heaps


Data Structures for Disjoint Sets


Graph Algorithms


Introduction


Elementary Graph Algorithms


Minimum Spanning Trees


Single-Source Shortest Paths


All-Pairs Shortest Paths


Maximum Flow


Selected Topics


Introduction


Sorting Networks


Matrix Operations


Linear Programming


Polynomials and the FFT


Number-Theoretic Algorithms


String Matching


Computational Geometry


NP-Completeness


Approximation Algorithms


Appendix: Mathematical Background


Introduction


Summations


Sets, Etc.


Counting and Probability


Bibliography


Index