Working through the book Grokking Algorithms

Exercises are worked in order and organized by chapter directory.

• Chapter 1. Introduction to Algorithms
  • Notes, Code, Tests
• Chapter 2. Selection Sort
  • Notes, Code, Tests
• Chapter 3. Recursion
  • Notes, Code, Tests
• Chapter 4. Quicksort
  • Notes, Code, Tests
• Chapter 5. Hash Tables
  • Notes, Code, Tests
• Chapter 6. Breadth-first Search
  • Notes, Code, Tests
• Chapter 7. Dijkstra’s algorithm
  • Notes, Code, Tests
• Chapter 8. Greedy algorithms
  • Notes, Code, Tests
• Chapter 9. Dynamic programming
  • Notes, Code, Tests
• Chapter 10. K-nearest neighbors
  • Notes, Code, Tests
• Chapter 11. Where to go next
  • Notes, Code, Tests