feat: add counting sort algo (#934)

Author: AfaqShuaib09

Javascript/Algorithms/bubble-sort renamed to Javascript/Algorithms/bubble-sort.js

@@ -1,25 +1,25 @@
-function bubbleSort(arr){
-    for(var i = 0; i < arr.length; i++){
-        // Last i elements are already in place
-        for(var j = 0; j < ( arr.length - i -1 ); j++){
-            
-            // Checking if the item at present iteration
-            // is greater than the next iteration
-            if(arr[j] > arr[j+1]){
-                
-            // If the condition is true then swap them
-            var temp = arr[j]
-            arr[j] = arr[j + 1]
-            arr[j+1] = temp
-            }
-        }
-    }
-// Print the sorted array
-console.log(arr);
-}
-
-// Unsorted array
-var arr = [234, 43, 55, 63, 5, 6, 235, 547];
-
-// Now pass this array to the bubbleSort() function
-bubbleSort(arr);
+function bubbleSort(arr){
+    for(var i = 0; i < arr.length; i++){
+        // Last i elements are already in place
+        for(var j = 0; j < ( arr.length - i -1 ); j++){
+            
+            // Checking if the item at present iteration
+            // is greater than the next iteration
+            if(arr[j] > arr[j+1]){
+                
+            // If the condition is true then swap them
+            var temp = arr[j]
+            arr[j] = arr[j + 1]
+            arr[j+1] = temp
+            }
+        }
+    }
+// Print the sorted array
+console.log(arr);
+}
+
+// Unsorted array
+var arr = [234, 43, 55, 63, 5, 6, 235, 547];
+
+// Now pass this array to the bubbleSort() function
+bubbleSort(arr);

Javascript/Algorithms/slow-sort.js

@@ -0,0 +1,28 @@
+function slowSort(arr) {
+    /**
+     * If the array has 1 or no elements then it is already sorted,
+     * return the array.
+     * Otherwise slice the array into two halves and merge sort each half,
+     * then merge the two sorted halves.
+     */
+    if (arr.length <= 1) {
+      return arr;
+    } else {
+      const mid = Math.floor(arr.length / 2);
+      const firstHalf = slowSort(arr.slice(0, mid));
+      const secondHalf = slowSort(arr.slice(mid));
+      
+      if (secondHalf[0] < firstHalf[firstHalf.length - 1]) {
+        [firstHalf[mid - 1], secondHalf[0]] = [secondHalf[0], firstHalf[mid - 1]];
+      }
+      
+      return firstHalf.concat(secondHalf);
+    }
+  }
+  
+
+// Example usage:
+const array = [9, 5, 2, 8, 3, 1, 4, 7, 6];
+const sortedArray = slowSort(array);
+console.log(sortedArray);
+// Output: [1, 2, 3, 4, 5, 6, 7, 8, 9]