📚 docs(README): Progress on structure.

Author: make-github-pseudonymous-again

README.md

@@ -41,19 +41,27 @@ isSorted(decreasing, [1, 2, 3], 0, 3); // false
 
 This package has several children:
 
-  - [aureooms/js-bucketsort](https://github.com/aureooms/js-bucketsort): bucketsort for JavaScript
+### :balance_scale: Comparison sorting
+
+  - :notebook_with_decorative_cover: [aureooms/js-in-situ-sort-spec](https://github.com/aureooms/js-in-situ-sort-spec): in place sorting for JavaScript
+    - :leaves: [aureooms/js-heapsort](https://github.com/aureooms/js-heapsort): heapsort for JavaScript
+    - :rabbit2: [aureooms/js-quicksort](https://github.com/aureooms/js-quicksort): quicksort for JavaScript
+    - :rewind: [aureooms/js-insertion-sort](https://github.com/aureooms/js-insertion-sort): Insertion sorting algorithms for JavaScript
+    - :person_fencing: [aureooms/js-merge-insertion-sort](https://github.com/aureooms/js-merge-insertion-sort): Ford-Johnson algorithm for JavaScript
+  - :dragon: [aureooms/js-mergesort](https://github.com/aureooms/js-mergesort): mergesort for JavaScript
+  - :musical_score: [aureooms/js-odd-even-mergesort](https://github.com/aureooms/js-odd-even-mergesort): Batcher's odd-even mergesort for JavaScript
+
+#### Subroutines
+
+  - :waning_gibbous_moon: [aureooms/js-merging](https://github.com/aureooms/js-merging): merging for JavaScript
+  - :cake: [aureooms/js-partition](https://github.com/aureooms/js-partition): partition for JavaScript
+  - :point_down: [aureooms/js-selection](https://github.com/aureooms/js-selection): selection for JavaScript
+
+### :zzz: Integer sorting
+
+  - :oden: [aureooms/js-radix-sort](https://github.com/aureooms/js-radix-sort): Radix sorting algorithms for JavaScript
   - [aureooms/js-countingsort](https://github.com/aureooms/js-countingsort): countingsort for JavaScript
-  - [aureooms/js-in-situ-sort-spec](https://github.com/aureooms/js-in-situ-sort-spec): in place sorting for JavaScript
-    - [aureooms/js-heapsort](https://github.com/aureooms/js-heapsort): heapsort for JavaScript
-    - [aureooms/js-quicksort](https://github.com/aureooms/js-quicksort): quicksort for JavaScript
-    - [aureooms/js-insertion-sort](https://github.com/aureooms/js-insertion-sort): Insertion sorting algorithms for JavaScript
-    - [aureooms/js-merge-insertion-sort](https://github.com/aureooms/js-merge-insertion-sort): Ford-Johnson algorithm for JavaScript
-  - [aureooms/js-mergesort](https://github.com/aureooms/js-mergesort): mergesort for JavaScript
-  - [aureooms/js-odd-even-mergesort](https://github.com/aureooms/js-odd-even-mergesort): Batcher's odd-even mergesort for JavaScript
-  - [aureooms/js-radix-sort](https://github.com/aureooms/js-radix-sort): Radix sorting algorithms for JavaScript
-  - [aureooms/js-merging](https://github.com/aureooms/js-merging): merging for JavaScript
-  - [aureooms/js-partition](https://github.com/aureooms/js-partition): partition for JavaScript
-  - [aureooms/js-selection](https://github.com/aureooms/js-selection): selection for JavaScript
+  - [aureooms/js-bucketsort](https://github.com/aureooms/js-bucketsort): bucketsort for JavaScript
 
 
 ## :link: Links