The selection sort algorithm is an in-place comparison sort algorithm. The general idea of the selection sort is to find the minimum value in the data structure, place it in the first position, then find the second minimum value, place it in the second position, and so on.
The following is the source code for the selection sort algorithm:
function selectionSort(array, compareFn = defaultCompare) { const { length } = array; // {1} let indexMin; for (let i = 0; i < length - 1; i++) { // {2} indexMin = i; // {3} for (let j = i; j < length; j++) { // {4} if (compareFn(array[indexMin], array[j]) === Compare.BIGGER_THAN) { // {5} indexMin = j; // {6} } } if (i !== indexMin) { // {7} swap(array, i, indexMin); } } return array; ...
