selectionSort.js

var a = ["S", "O", "R", "T", "E", "X", "A", "M", "P", "L", "E"];

for (let i = 0; i < a.length; i++) {
  let f = i;
  let low = f;

  while (f < a.length) {
    if (a[f] > a[low]) {
      low = f;
    }
    f++;
  }
  let tempValue = a[low];
  a.splice(low, 1);
  a.unshift(tempValue);
}
console.log(a);

// Proposition A.
// Selection sort uses N^2/2 compares and N exchanges to sort an array of length N.
// runtime of this on an array that is fully in order is the same as an array that is fully out of order!
// this is because of the N exchanges