mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2024-11-15 17:30:52 +00:00
add readme with links
This commit is contained in:
parent
f310eda779
commit
2ad10efb47
52
README.md
Normal file
52
README.md
Normal file
@ -0,0 +1,52 @@
|
|||||||
|
# Grokking Algorithms 2E v4
|
||||||
|
|
||||||
|
### Binary Search
|
||||||
|
|
||||||
|
[chapter1][binary]
|
||||||
|
|
||||||
|
### Selection Sort
|
||||||
|
|
||||||
|
[chapter2][selection_sort]
|
||||||
|
|
||||||
|
### Recursion
|
||||||
|
|
||||||
|
[chapter3][recursion]
|
||||||
|
|
||||||
|
### Quicksort
|
||||||
|
|
||||||
|
[chapter4][quick_sort]
|
||||||
|
|
||||||
|
### Breadth-First Search
|
||||||
|
|
||||||
|
[chapter6][quick_sort]
|
||||||
|
|
||||||
|
### Trees
|
||||||
|
|
||||||
|
[chapter7][trees]
|
||||||
|
|
||||||
|
### Dijkstra
|
||||||
|
|
||||||
|
[chapter9][dijkstra]
|
||||||
|
|
||||||
|
### Greedy
|
||||||
|
|
||||||
|
[chapter10][greedy]
|
||||||
|
|
||||||
|
### Dynamic Programming
|
||||||
|
|
||||||
|
[chapter11][dynamic]
|
||||||
|
|
||||||
|
### K-Nearest Neighbours
|
||||||
|
|
||||||
|
[chapter12][knn]
|
||||||
|
|
||||||
|
[binary]: ./chapter1/
|
||||||
|
[selection_sort]: ./chapter2/
|
||||||
|
[recursion]: ./chapter3/
|
||||||
|
[quick_sort]: ./chapter4/
|
||||||
|
[bfs]: ./chapter6/
|
||||||
|
[trees]: ./chapter7/
|
||||||
|
[dijkstra]: ./chapter9/
|
||||||
|
[greedy]: ./chapter10/
|
||||||
|
[dynamic]: ./chapter11/
|
||||||
|
[knn]: ./chapter12/
|
Loading…
Reference in New Issue
Block a user