Writers: Thomas H. Cormen, Charles E. Leiserson & Ronald L. Rivest
Catogary: Electrical & Computer
Total Pages: 1339
Contents:
- Mathematical Foundations
- Growth of Functions
- Summations
- Recurrences
- 5 Sets, etc
- Counting & Probability
- Heapsort
- Qucik Sort
- Sorting in Linear time
- Medians & other Statistics
- Advance Design & Analysis Techniques
- Advance Data Structures
- B Trees
- Binomial Heaps
- Fabonacci Heaps
- Data Structures for Disjoint Sets
- Graph Alogrithms
- Sorting Networks
- Arithmetic Circuits
- Alogrithms for Parallel computers
- Matrix Operations
- Polynomials & FFT
- Number-Theoretic Alogrithms
- String Matching
- Computational Geometry
- NP Completeness
- Approximation Alogrithms
No comments:
Post a Comment