Product Information
Complete downloadable Solutions Manual for Introduction to Algorithms 2nd Edition by Cormen. INSTRUCTOR RESOURCE INFORMATION
TITLE: Introduction to Algorithms
RESOURCE:Solutions Manual
EDITION: 2nd Edition
AUTHOR: Cormen, Leiserson, Rivest, Stein
PUBLISHER: PB0
Table of content
1. The Role of Algorithms in Computing
2. Getting Started
3. Growth of Functions
4. Recurrences
5. Probabilistic Analysis and Randomized Algorithms
7. Quicksort
8. Sorting in Linear Time
9. Medians and Order Statistics
11. Hash Table
12. Binary Search Trees
13. Red-Black Trees
14. Augmenting Data Structures
15. Dynamic Programming
16. Greedy Algorithms
17. Amortized Analysis
18. B-Trees
19. Binomial Heaps
20. Fibonacci Heaps
21. Data Structures for Disjoint Sets
22. Elementary Graph Algorithms
23. Minimum Spanning Trees
24. Single-Source Shortest Paths
25. All-Pairs Shortest Paths 26 Maximum Flow
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
Loading...
Reload document
Open in new tab 
