A super book on algorithms and can be used by professionals who wanted to brush up the fundamentals. "6.006 Introduction to Algorithms" is an online course from MIT which follows this book as the textbook. Topics covered in this course are
- 3. Growth of functions
* Big-O
- 4. Divide and conquer
* Recursion
- 6. Heapsort
* AVL
- 12. Binary Search Tree
- 13. Red-Black tree
- 8. Sorting in linear time
* Counting Sort
* RADIX Sort
* Bucket Sort
- 11. Hash tables
- 22. Elementary Graph Algorithms
* BFS
* HFS
* Topological Sort
* Directed Acyclic Graph (DAG)
- 24. Single-source shortest paths
* Bellman-Ford Algorithm
* Dijkstra's Algorithm
- 15. Dynamic programming
* Optimal substructure and Overlapping subproblems
- 34. NP-completeness (only introduction, more in next course)
