Table of Contents:

1. Introduction
2. Mathematics for Algorithmic
3. Greedy Algorithms
4. Divide & Conquer Algorithms
5. Dynamic Programming
6. Amortized Analysis
7. Hash Table
8. Binary Search Tree
9. Graph Algorithms
10. String Matching
11. Sorting
12. Linear-Time Sorting
13. Computational Geometry
14. Computational Complexity
15. Approximate Algorithms
16. Linear Programming