grokking-algorithms

My notes while reading Grokking Algorithms by Aditya Bhargava.

Chapters

1. Introduction to Algorithms
2. Selection Sort
3. Recursion
4. Quicksort
5. Hash Tables
6. Breadth-First Search (BFS)
7. Dijkstra's Algorithm
8. Greedy Algorithm
9. Dynamic Programming
10. K-Nearest Neighbors

Examples

To run some examples, please use the following command:

make run

Tests

To run the tests and ensure the correctness of the implemented algorithms, please use the following command:

make test

Benchmarking

To execute benchmark tests for algorithms that have them and compare their performance, please use the following command:

make bench