Grokking algorithms: an illustrated guide for programmers and other curious people/
xviii , 238 pages Ill.; 25 cm. Content notes : 1. Introduction to algorithms -- 2. Selection sort -- 3. Recursion -- 4. Quicksort -- 5. Hash tables -- 6. Breadth-first search -- 7. Dijkstra's algorithm -- 8. Greedy algorithms -- 9. Dynamic programming -- 10. K-nearest neighbors -- 11. Where to go next Programming Language
