Grokking Algorithms

This repository includes a brief summary of Grooking Algorithms, which I believe is a great book for anyone interested in Computer Science.

According to 'Programming Pearls', only 10% of professional programmers are able to implement binary search in their code. They can explain it very well, but coding it is a challenge for them.

Each folder follows the chapter structure of the book, and includes:

1. Summary as markdown
2. Summary as PDF
3. Code examples in Python
4. Code examples in Ruby
5. Images and charts related with the chapter.

TOC

1. Binary Search
2. Big-o Notation
3. Selection Sort
4. Recursion
5. Quicksort
6. Hash Tables
7. Breadth-first Search
8. Dikstras Algorith
9. Greedy Algorithms
10. Dynamic Programming
11. K-Nearest Neighbors
12. Bellman-ford Algorithm
13. Where to Go Next

PDFs

• Summary PDFs are generated with Markdown PDF.

Contributing

This repository is open for any contributions, simply fork the repo and create a PR/MR to contribute.