Implement a Bubble Sort Algorithm

bubbleSort.js

/* Using C Style for-Loop */
const bubbleSort = array => {
  const arr = array.slice();
  for (let i = 0; i < arr.length - 1; i++) {
    for (let j = 0; j < arr.length - 1 - i; j++) {
      if (arr[j] > arr[j + 1]) {
        swap(arr, j, j + 1);
      }
    }
  }
  return arr;
};

bubbleSort2.js

/* Using while-loop */
const bubbleSort2 = array => {
  const arr = array.slice();
  let counter = arr.length;
  while (counter > 0) {
    for (let i = 0; i < arr.length - 1; i++) {
      if (arr[i] > arr[i + 1]) swap(arr, i, i + 1);
    }
    counter--;
  }
  return arr;
};

bubbleSort3.js

/* Using recursive Function */
const bubbleSort3 = array => {
  const arr = array.slice();
  const recursiveSort = (arr, indx) => {
    let i = indx;
    if (i === arr.length - 1) return arr;

    for (let j = 0; j < arr.length - 1 - i; j++) {
      if (arr[j] > arr[j + 1]) {
        swap(arr, j, j + 1);
      }
    }
    i++;
    return recursiveSort(arr, i);
  };
  return recursiveSort(arr, 0);
};