- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Introduction To Algorithms 1ST Editionby Thomas H Cormen
Synopses & ReviewsPlease note that used books may not include additional media (study guides, CDs, DVDs, solutions manuals, etc.) as described in the publisher comments.
Includes bibliographcal references (p. -996) and index.
Table of Contents
Growth of functions — Summations — Recurrences — Sets, etc. — Counting and probability — Heapsort — Quicksort — Sorting in linear time — Medians and order statistics — Elementary data structures — Hash tables — Binary search trees — Red-black trees — Augmenting data structures — Dynamic programming — Greedy algorithms — Amortized analysis — B-trees — Binomial heaps — Fibonacci heaps — Data structures for disjoint sets — Elementary graph algorithms — Minimum spanning trees — Single-source shortest paths — All-pairs shortest paths — Maximum flow — Sorting networks — Arithmetic circuits — Algorithms for parallel computers — Matrix operations — Polynomials and the FFT — Number-theoretic algorithms — String matching — Computational geometry — NP-completeness — Approximation algorithms.
What Our Readers Are Saying
Average customer rating based on 3 comments:
Other books you might like