hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-14 06:52:59 +08:00
Code Issues Packages Projects Releases Wiki Activity

Change radix and counting sorting algorithms difficulty.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-07-22 17:56:19 +03:00
parent 3c00a69587
commit eec7f2f917
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -99,8 +99,8 @@ a set of rules that precisely define a sequence of operations.
* `B` [Merge Sort](src/algorithms/sorting/merge-sort) * `B` [Merge Sort](src/algorithms/sorting/merge-sort)
* `B` [Quicksort](src/algorithms/sorting/quick-sort) - in-place and non-in-place implementations * `B` [Quicksort](src/algorithms/sorting/quick-sort) - in-place and non-in-place implementations
* `B` [Shellsort](src/algorithms/sorting/shell-sort) * `B` [Shellsort](src/algorithms/sorting/shell-sort)
* `A` [Counting Sort](src/algorithms/sorting/counting-sort) * `B` [Counting Sort](src/algorithms/sorting/counting-sort)
* `A` [Radix Sort](src/algorithms/sorting/radix-sort) * `B` [Radix Sort](src/algorithms/sorting/radix-sort)
* **Trees** * **Trees**
* `B` [Depth-First Search](src/algorithms/tree/depth-first-search) (DFS) * `B` [Depth-First Search](src/algorithms/tree/depth-first-search) (DFS)
* `B` [Breadth-First Search](src/algorithms/tree/breadth-first-search) (BFS) * `B` [Breadth-First Search](src/algorithms/tree/breadth-first-search) (BFS)