Aditya Y BhargavaGrokking Algorithms, 2nd Edition
1.
1 Introduction to algorithms
2.
2 Selection sort
3.
3 Recursion
4.
4 Quicksort
5.
5 Hash Tables
6.
6 Breadth-First Search
7.
7 Trees
8.
8 Binary Search Trees
9.
9 Dijkstra’s Algorithm
10.
10 Greedy Algorithms
11.
11 Dynamic Programming
12.
12 K Nearest Neighbors
13.
13 Where to Go Next
14.
Appendix A. Performance of AVL trees
15.
Appendix B. NP-hard problems
16.
Appendix C. Answers to exercises
