Efficient Algorithm Design

Table of Contents

1. Introduction to Algorithm Analysis
2. Mathematical Induction and Loop Invariant for Algorithm Correctness
3. Rate of Growth for Complexity Analysis
4. Recursion and Recurrence Functions
5. Solving Recurrence Functions
6. Sorting Algorithms
7. Search Algorithms
8. Symbiotic Relationship between Sort and Search
9. Randomized Algorithms
10. Dynamic Programming
11. Landscape of Data Structures
12. Linear Data Structures
13. Non-Linear Data Structures
14. Tomorrow's Algorithms