# Grokking Algorithms 2E v4

### Binary Search

[chapter1][binary]

### Selection Sort

[chapter2][selection_sort]

### Recursion

[chapter3][recursion]

### Quicksort

[chapter4][quick_sort]

### Breadth-First Search

[chapter6][bfs]

### Trees

[chapter7][trees]

### Dijkstra

[chapter9][dijkstra]

### Greedy

[chapter10][greedy]

### Dynamic Programming

[chapter11][dynamic]

### K-Nearest Neighbours

[chapter12][knn]

[binary]: ./chapter_01/
[selection_sort]: ./chapter_02/
[recursion]: ./chapter_03/
[quick_sort]: ./chapter_04/
[bfs]: ./chapter_06/
[trees]: ./chapter_07/
[dijkstra]: ./chapter_09/
[greedy]: ./chapter_10/
[dynamic]: ./chapter_11/
[knn]: ./chapter_12/