Adding the Matrix traversal and generation to the Divide and Conquer section.

This commit is contained in:
Oleksii Trekhleb 2020-12-19 19:33:35 +01:00
parent 3e5ddb8143
commit 636ebe1e26

View File

@ -185,7 +185,7 @@ algorithm is an abstraction higher than a computer program.
* `B` [Quicksort](src/algorithms/sorting/quick-sort) * `B` [Quicksort](src/algorithms/sorting/quick-sort)
* `B` [Tree Depth-First Search](src/algorithms/tree/depth-first-search) (DFS) * `B` [Tree Depth-First Search](src/algorithms/tree/depth-first-search) (DFS)
* `B` [Graph Depth-First Search](src/algorithms/graph/depth-first-search) (DFS) * `B` [Graph Depth-First Search](src/algorithms/graph/depth-first-search) (DFS)
* `B` [Matrices](src/algorithms/math/matrix) - generating and traversing the matrices of different depths * `B` [Matrices](src/algorithms/math/matrix) - generating and traversing the matrices of different shapes
* `B` [Jump Game](src/algorithms/uncategorized/jump-game) * `B` [Jump Game](src/algorithms/uncategorized/jump-game)
* `B` [Fast Powering](src/algorithms/math/fast-powering) * `B` [Fast Powering](src/algorithms/math/fast-powering)
* `A` [Permutations](src/algorithms/sets/permutations) (with and without repetitions) * `A` [Permutations](src/algorithms/sets/permutations) (with and without repetitions)