Implement a Selection Sort Algorithm

selectionSort.js

/* Method 1 - Using C Style for-loop */
const selectionSort = array => {
  const arr = array.slice();
  for (let i = 0; i < arr.length - 1; i++) {
    for (let j = i; j < arr.length - 1; j++) {
      const select = Math.min(...arr.slice(j, arr.length));
      if (select < arr[j]) swap(arr, j, arr.lastIndexOf(select));
    }
  }
  return arr;
};

selectionSort2.js

/* Method 2 - Using for-in loop */
const selectionSort2 = array => {
  const arr = array.slice();
  for (let c in arr) {
    for (let i = c; i < arr.length - 1; i++) {
      const select = Math.min(arr[i], ...arr.slice(i + 1, array.length));
      if (select < arr[i]) swap(arr, i, arr.lastIndexOf(select));
    }
  }
  return arr;
};

selectionSort3.js

/* Method 3 - Using while loop */
const selectionSort3 = array => {
  const arr = array.slice();
  let i = 0;
  while (i < arr.length - 1) {
    let j = i;
    while (j < arr.length - 1) {
      const select = Math.min(arr[i], ...arr.slice(i + 1, array.length));
      if (select < arr[i]) swap(arr, i, arr.lastIndexOf(select));
      j++;
    }
    i++;
  }
  return arr;
};

selectionSort4.js

/* Method 4 - Using Recursive Function */
const selectionSort4 = array => {
  const recursiveSort = (arr, indx) => {
    let i = indx;
    if (i === arr.length - 1) return arr;
    for (let j = i; j < arr.length - 1; j++) {
      const select = Math.min(arr[j], ...arr.slice(j + 1, arr.length));
      if (select < arr[j]) swap(arr, j, arr.lastIndexOf(select));
    }
    i++;
    return recursiveSort(arr, i);
  };
  return recursiveSort([...array], 0);
};