selectionSort.js

/**Similar to bubble sort, but instead of first
 * placing large values into sorted position,
 * it places small values into sorted position
 */

/**
 * SELECTION SORT PSEUDOCODE
 * Store the first element as the smallest value you've seen so far.
 * Compare this item ot the next item in the array until you find a
 * smaller number.
 * If the "minimum" is not the value (index) you initially began
 * with, swap the two values.
 * Repeat with the next element until the array is sorted.
 */

function selectionSort(arr) {
  for (var i = 0; i < arr.length; i++) {
    var lowest = i;
    for (var j = i + 1; j < arr.length; j++) {
      // console.log(i, j);
      if (arr[j] < arr[lowest]) {
        lowest = j;
      }
    }
    if (i !== lowest) {
      var temp = arr[i];
      arr[i] = arr[lowest];
      arr[lowest] = temp;
    }
  }
  return arr;
}

selectionSort([34, 22, 10, 19, 17]);

// ES2015

function selectionSort(arr) {
  const swap = (arr, idx1, idx2) => [
    arr[idx1],
    (arr[idx2] = arr[idx2]),
    arr[idx1],
  ];

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