add bead sort

Author: dmitrymorozoff

README.md

@@ -11,6 +11,7 @@
 6. [Сортировка кучей / Heap Sort](https://github.com/dmitrymorozoff/algorithms-in-javascript/blob/master/source/heap/binary-heap/binary-heap.js) | [Инфо](https://neerc.ifmo.ru/wiki/index.php?title=%D0%A1%D0%BE%D1%80%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0%BA%D0%B0_%D0%BA%D1%83%D1%87%D0%B5%D0%B9)
 7. [Гномья сортировка / Gnome sort](https://github.com/dmitrymorozoff/algorithms-in-javascript/blob/master/source/sorts/gnome-sort/gnome-sort.js) | [Инфо](http://sorting.valemak.com/gnome/)
 7. [Соломонова Сортировка / Solomon sort](https://github.com/dmitrymorozoff/algorithms-in-javascript/blob/master/source/sorts/solomon-sort/solomon-sort.js) | [Инфо](http://sorting.valemak.com/solomon/)
+7. [Бисерная сортировка / Bead Sort](https://github.com/dmitrymorozoff/algorithms-in-javascript/blob/master/source/sorts/bead-sort/bead-sort.js) | [Инфо](http://sorting.valemak.com/bead/)
 
 ## Структуры данных / Data Structures
 1. [Стек / Stack](https://github.com/dmitrymorozoff/algorithms-in-javascript/blob/master/source/structures/stack.js) | [Инфо](https://ru.wikipedia.org/wiki/%D0%A1%D1%82%D0%B5%D0%BA)

index.html

@@ -16,6 +16,7 @@
     <script src="./source/sorts/quick-sort/quick-sort.js" type="module"></script>
     <script src="./source/sorts/gnome-sort/gnome-sort.js" type="module"></script>
     <script src="./source/sorts/solomon-sort/solomon-sort.js" type="module"></script>
+    <script src="./source/sorts/bead-sort/bead-sort.js" type="module"></script>
     <script src="./source/structures/stack.js" type="module"></script>
     <script src="./source/structures/queue.js" type="module"></script>
     <script src="./source/structures/singly-list.js" type="module"></script>

source/sorts/bead-sort/bead-sort.js

@@ -0,0 +1,34 @@
+export default function beadSort(array) {
+    let beadArray = [];
+    let sortedArray = [];
+    for (let i = 0; i < array.length; i++) {
+        beadArray[i] = [];
+    }
+    let levelCount = [];
+    for (let i = 0; i < Math.max(...array); i++) {
+        levelCount[i] = 0;
+    }
+    for (let i = 0; i < array.length; i++) {
+        for (let j = 0; j < array[i]; j++) {
+            beadArray[i].push(0);
+        }
+    }
+    for (let i = 0; i < array.length; i++) {
+        let element = array[i];
+        for (let j = 0; element > 0; j++) {
+            beadArray[levelCount[j]++][j] = 1;
+            element--;
+        }
+    }
+    for (let i = beadArray.length - 1; i >= 0; i--) {
+        let value = 0;
+        for (let j = 0; j < beadArray[i].length; j++) {
+            if (beadArray[i][j]) {
+                value++;
+            }
+        }
+        sortedArray.push(value);
+        value = 0;
+    }
+    return sortedArray;
+}

source/sorts/bead-sort/bead-sort.spec.js

@@ -0,0 +1,13 @@
+import beadSort from "./bead-sort";
+
+describe("bead-sort", () => {
+    test("should return [1,2,3,4,5,6] if sort", () => {
+        const testArray = [3, 1, 2, 4, 6, 5];
+        expect(beadSort(testArray)).toEqual([1, 2, 3, 4, 5, 6]);
+    });
+
+    test("should return [12,22,44,45,56,76] if sort", () => {
+        const testArray = [22, 12, 45, 44, 76, 56];
+        expect(beadSort(testArray)).toEqual([12, 22, 44, 45, 56, 76]);
+    });
+});