Author: Aditya Bhargava
Chapter 1 - Binary search / Big O notation
Chapter 2 - Selection Sort
Chapter 3 - Recursion
Chapter 4 - Quick sort
Chapter 5 - Hash tables
Chapter 6 - Breadth-first search (BFS)
Chapter 7 - Dijkstra’s algorithm
Chapter 8 - Greedy algorithms
Chapter 9 - Dynamic programming
Chapter 10 - K-nearest neighbors