add gnome and solomon sort

Author: dmitrymorozoff

README.md

@@ -9,6 +9,8 @@
 4. [Сортировка чёт-нечет / OddEven Sort](https://github.com/dmitrymorozoff/algorithms-in-javascript/blob/master/source/sorts/odd-even-sort/odd-even-sort.js) | [Инфо](https://ru.wikipedia.org/wiki/%D0%A1%D0%BE%D1%80%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0%BA%D0%B0_%D1%87%D1%91%D1%82-%D0%BD%D0%B5%D1%87%D0%B5%D1%82)
 5. [Быстрая сортировка / Quick Sort](https://github.com/dmitrymorozoff/algorithms-in-javascript/blob/master/source/sorts/quick-sort/quick-sort.js) | [Инфо](https://habrahabr.ru/sandbox/29775/)
 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/)
 
 ## Структуры данных / 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

@@ -14,6 +14,8 @@
     <script src="./source/sorts/selection-sort/selection-sort.js" type="module"></script>
     <script src="./source/sorts/odd-even-sort/odd-even-sort.js" type="module"></script>
     <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/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/gnome-sort/gnome-sort.js

@@ -0,0 +1,17 @@
+import { swap } from "../../utils/helpers.js";
+
+export default function gnomeSort(array) {
+    let counter = 1;
+    while (counter < array.length) {
+        if (counter === 0) {
+            counter = 1;
+        }
+        if (array[counter - 1] <= array[counter]) {
+            counter++;
+        } else {
+            swap(array, counter, counter - 1);
+            counter--;
+        }
+    }
+    return array;
+}

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

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

source/sorts/solomon-sort/solomon-sort.js

@@ -0,0 +1,30 @@
+export default function solomonSort(array) {
+    const min = Math.min(...array);
+    const max = Math.max(...array);
+    const n = array.length - 1;
+    const delta = Math.floor((max - min) / n);
+    let sortedArray = [];
+    let indexArray = [];
+    let newArray = [];
+    for (let i = 0; i < array.length; i++) {
+        indexArray[i] = 0;
+        newArray[i] = [];
+    }
+    for (let i = 0; i < array.length; i++) {
+        let newIndex = (array[i] - min) / delta + 1;
+        newIndex = Math.floor(newIndex);
+        indexArray[newIndex - 1]++;
+        newArray[newIndex - 1].push(array[i]);
+    }
+    for (let i = 0; i < array.length; i++) {
+        if (!!newArray[i][0]) {
+            while (newArray[i].length !== 0) {
+                let minValue = Math.min(...newArray[i]);
+                let minIndex = newArray[i].indexOf(minValue);
+                newArray[i].splice(minIndex, 1);
+                sortedArray.push(minValue);
+            }
+        }
+    }
+    return sortedArray;
+}

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

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