Add links for recently created units

README.md

@@ -18,7 +18,7 @@ Here is the list of completed and planned teaching units. As they are still unde
 8. [Segment tree](08-segment-tree) (regular, lazy)
 9. Fenwick tree (binary indexing, least significant bit)
 10. [Recursive backtracking](10-recursive-backtracking) (pruning, bitmasks)
-11. Binary search (nontrivial applications, binary search the answer)
+11. [Binary search](11-binary-search) (nontrivial applications, binary search the answer)
 12. Greedy
 13. [Dynamic programming I](13-dynamic-programming-i) (top-down, bottom-up, classical problems)
 14. [Graph traversal](14-traversal) (DFS, BFS, toposort, bipartite check, Kosaraju SCC)
@@ -28,10 +28,10 @@ Here is the list of completed and planned teaching units. As they are still unde
 18. [All-pairs shortest path](18-all-pairs-shortest-path) (Floyd-Warshall, applications)
 19. [Network flow](19-network-flow) (Edmonds-Karp, min cut, vertex capacity, vertex/edge-disjoint paths, MCMF)
 20. Directed acyclic graph (longest/shortest/counting paths, tree MVC)
-21. Euler path/cycle (eulerian check, finding the path/cycle, chinese postman problem)
+21. [Eulerian path](21-eulerian) (eulerian check, finding the path/cycle, Chinese postman problem)
 22. Bipartite graph and MCBM (augmenting path algorithm, MIS, MVC, min path cover on DAG)
 23. [Miscellaneous math](23-misc-math) (fast pow, Fibonacci, powers of adjacency matrix, tortoise and hare)
-24. Number theory (GCD, prime factors, sieve, extended Euclid)
+24. [Number theory](24-number-theory) (GCD, prime factors, sieve, extended Euclid)
 25. Game theory (minimax strategy, Nim game)
 26. [String processing](26-string-processing) (trie, Rabin-Karp, Z-algorithm, KMP)
 27. Computational geometry (basics, polygon area, convex hull)