Merge pull request #89 from wakidurrahman/feat/codeing-challenges-001

Feat/coding challenges 001

Author: wakidurrahman

src/code-challenges/bubble-sort.js

@@ -6,12 +6,11 @@
 
 // Normal
 function bubbleSortVariationNormal(arr) {
+  const len = arr.length - 1;
   let swaps;
   do {
     swaps = false;
-    for (let i = 0; i < arr.length - 1; i++) {
-      const element = arr[i];
-      console.log(element);
+    for (let i = 0; i < len; i++) {
       if (arr[i] > arr[i + 1]) {
         // start with the first two elements and sort them in ascending order. (Compare the element to check which one is greater).
         let temp = arr[i + 1]; // store second element for  swap
@@ -26,3 +25,24 @@ function bubbleSortVariationNormal(arr) {
 }
 
 bubbleSortVariationNormal([6, 5, 3, 1, 8, 7, 2, 4]);
+
+// Recursively
+const bubbleSortVariationRecursive = function (array, pointer = array.length - 1) {
+  // Base check
+  if (pointer === 0) {
+    return array;
+  }
+
+  for (let i = 0; i < pointer; i++) {
+    if (array[i] > array[i + 1]) {
+      let temp = array[i + 1];
+      array[i + 1] = array[i];
+      array[i] = temp;
+    }
+  }
+
+  // Recursive call on smaller portion of the array
+  return bubbleSortVariationRecursive(array, pointer - 1);
+};
+
+bubbleSortVariationRecursive([6, 5, 3, 1, 8, 7, 2, 4]);