Introduction to Algorithms

ISBN-10: 0070131511

ISBN-13: 9780070131514

Edition: 2nd 2002

List price: $110.00
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description:

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $110.00
Edition: 2nd
Copyright year: 2002
Publisher: McGraw-Hill Higher Education
Publication date: 7/16/2001
Binding: Hardcover
Pages: 1056
Size: 8.00" wide x 9.00" long x 2.00" tall
Weight: 4.950
Language: English

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
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×