Introduction to algorithms / by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
Material type: TextSeries: Publication details: Cambridge, Mass. : New York : MIT Press ; McGraw-Hill, 1990Description: xvii, 1028 p. : ill. ; 27 cmISBN: 0070131430 (hbk)Subject(s): Computer programming | AlgorithmsDDC classification: 005.1Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Books | Namal Library Computer Science | 005.1 COR-I 1989 6972 (Browse shelf (Opens below)) | Available | 0006972 |
Includes index.
Bibliography: p. [987]-996.
1. Introduction
2. Growth Functions
3. Summations
4. Recurrences
5. Sets, Etc.
6. Counting and Probability
7. Heapsort
8. Quicksort
9. Sorting in Linear Time
10. Medians and Order Statistics
11. Elementary Data Structures
12. Hash Tables
13. Binary Search Trees
14. Red-Black Trees
15. Augmenting Data Structures
16. Dynamic Programming
17. Greedy Algorithms
18. Amortized Analysis
19. B-Trees
20. Binomial Heaps
21. Fibonacci Heaps
22. Data Structures for Disjoint Sets
23. Elementary Graph Algorithms
24. Minimum Spanning Trees
25. Single-Source Shortest Paths
26. All-Pairs Shortest Paths
27. Maximum Flow
28. Sorting Networks
29. Arithmetic Circuits
30. Algorithms for Parallel Computers
31. Matrix Operations
32. Polynomials and FFT
33. Number Theoretic Algorithms
34. String Matching
35. Computational Geometry
36. NP-Completeness
37. Approximation Algorithms
There are no comments on this title.