Introduction to algorithms / Thomas H. Cormen ... [et. al.]
Publication details: New Delhi : PHI Learning, c2009. Edition: 3rd edDescription: xix, 1292 p. : ill. ; 23 cmISBN: 9788120340077DDC classification: 004 INT| Item type | Current library | Home library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
English Lending
|
Villa College Library | Villa College Library | 004 INT (Browse shelf(Opens below)) | In transit from Villa College QI Campus to Villa College Library since 06/26/2022 | 015 |
Browsing Villa College Library shelves Close shelf browser (Hides shelf browser)
CONTENT
I. Foundations
1. The Role of Algorithms in Computing
2. Getting Started
3. Growth of Functions
4. Divide-and-Conquer
5. Probabilistic Analysis and Randomized Algorithms
II. Sorting and Order Statistics
6. Heapsort
7. Quicksort
8. Sorting in Linear Time
9. Medians and Order Statistics
III. Data Structures
10. Elementary Data Structures
11. Hash Tables
12. Binary Search Trees
13. Red-Black Trees
14. Augmenting Data Structures
IV. Advanced Design and Analysis Techniques
15. Dynamic Programming
16. Greedy Algorithms
17. Amortized Analysis
V. Advanced Data Structures
18. B-Trees
19. Fibonacci Heaps
20. van Emde Boas Trees
21. Data Structures for Disjoint Sets
VI. Graph Algorithms
22. Elementary Graph Algorithms
23. Minimum Spanning Trees
24. Single-Source Shortest Paths
25. All-Pairs Shortest Paths
26. Maximum Flow
VII. Selected Topics
27. Multithreaded Algorithms.
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
VIII. Appendix: Mathematical Background
A. Summations
B. Sets, Etc
C. Counting and Probability
D. Matrices.
Includes bibliographical references and index.
There are no comments on this title.