Selection Sort

function selectionSort(nums) {
  for (let i = 0; i < nums.length; i++) {
    let min = i;
    for (let j = i + 1; j < nums.length; j++) {
      if (nums[j] < nums[min]) min = j;
    }
    [nums[i], nums[min]] = [nums[min], nums[i]];
  }
  return nums;
}
                  

Explanation: We repeatedly select the minimum element and place it at the beginning.

⏱ O(n²) | 💾 O(1)