Change radix and counting sorting algorithms difficulty.

trekhleb · trekhleb · commit eec7f2f917dc · 2018-07-22T17:56:19.000+03:00
diff --git 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)
