Feature/bogo sort

src/algorithms/bogo-sort.js

@@ -0,0 +1,28 @@
+function isSorted(arr) {
+    let len = arr.length;
+
+    for (let i=0; i< len; i++){
+        if (arr[i] > arr[i+1]){
+            return false;
+        }
+    }
+  return true;  
+}
+
+function shuffle(arr) {
+    let len = arr.length
+    for (let i = len-1; i>= 0; i--){
+        let index = Math.floor(math.random()*i)
+        let temp = arr[i-1]
+        arr[i-1] = arr[index]
+        arr[index] = temp
+    }
+
+}
+
+function bogoSort(arr){
+    while(!isSorted(arr)){
+        shuffle(arr)
+    }
+    return arr
+}

src/algorithms/bubble-sort.js

@@ -0,0 +1,18 @@
+function bubbleSort(arr) {
+
+    let len = arr.length;
+
+    for(let i = 0; i <len-1; i++){
+        for(let j = 0; j < len-1-i; j++){
+
+            if (arr[j+1]< arr[j]){
+                let temp = arr[j+1];
+                arr[j+1] = arr[j];
+                arr[j]= temp;
+            }
+        }
+    }
+    return arr;
+}
+
+

src/algorithms/insertion-sort.js

@@ -0,0 +1,17 @@
+function insertionSort(arr) {
+
+    let len = arr.length;
+
+    for (let i = 1; i < len; i++){
+
+        let currentValue = arr[i];
+        let j= i-1;
+
+        while((j>=0) && (arr[j]> currentValue)){
+            arr[j+1] = arr[j]
+            j--;
+        }
+        arr[j+1] = currentValue;
+    }
+    return arr;
+}

src/algorithms/quick-sort.js

@@ -0,0 +1,40 @@
+function partition(arr, leftIndex, rightIndex) {
+
+    let midIndex = Math.floor((leftIndex + rightIndex)/2);
+    let pivot = arr[midIndex]
+
+    while (leftIndex <= rightIndex){
+
+        while (arr[rightIndex] > pivot){
+            rightIndex--;
+        }
+
+        while (arr[leftIndex] < pivot){
+            leftIndex++;
+        }
+
+        if (leftIndex <= rightIndex){
+            var temp = arr[leftIndex];
+            arr[leftIndex]= arr[rightIndex];
+            arr[rightIndex]= temp;
+            leftIndex++;
+            rightIndex--;
+        }
+    }
+   return leftIndex; 
+}
+
+function quickSort(arr, leftIndex, rightIndex) {
+    let len = arr.lenght;
+    if(len>1){
+        let index= partition(arr, leftIndex, rightIndex);
+        if(leftIndex < index-1){
+            quickSort(arr, leftIndex, index-1);
+        }
+        if(rightIndex > index){
+            quickSort(arr, index, rightIndex);
+        }
+        return arr;
+    }
+
+}