From eec7f2f917dc55fe01684d431706e9de130dfc7e Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Sun, 22 Jul 2018 17:56:19 +0300 Subject: [PATCH] Change radix and counting sorting algorithms difficulty. --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 653c4866..8a74f564 100644 --- a/README.md +++ b/README.md @@ -99,8 +99,8 @@ a set of rules that precisely define a sequence of operations. * `B` [Merge Sort](src/algorithms/sorting/merge-sort) * `B` [Quicksort](src/algorithms/sorting/quick-sort) - in-place and non-in-place implementations * `B` [Shellsort](src/algorithms/sorting/shell-sort) - * `A` [Counting Sort](src/algorithms/sorting/counting-sort) - * `A` [Radix Sort](src/algorithms/sorting/radix-sort) + * `B` [Counting Sort](src/algorithms/sorting/counting-sort) + * `B` [Radix Sort](src/algorithms/sorting/radix-sort) * **Trees** * `B` [Depth-First Search](src/algorithms/tree/depth-first-search) (DFS) * `B` [Breadth-First Search](src/algorithms/tree/breadth-first-search) (BFS)