Start of main content
Sorts an array of numbers, using the selection sort algorithm.
- Use the spread operator (
...) to clone the original array,arr. - Use a
forloop to iterate over elements in the array. - Use
Array.prototype.slice()andArray.prototype.reduce()to find the index of the minimum element in the subarray to the right of the current index. Perform a swap, if necessary.
const selectionSort = arr => {
const a = [...arr];
for (let i = 0; i < a.length; i++) {
const min = a
.slice(i + 1)
.reduce((acc, val, j) => (val < a[acc] ? j + i + 1 : acc), i);
if (min !== i) [a[i], a[min]] = [a[min], a[i]];
}
return a;
};selectionSort([5, 1, 4, 2, 3]); // [1, 2, 3, 4, 5]Recommended snippets
Heap sort
JavaScript, Algorithm
Sorts an array of numbers, using the heapsort algorithm.
Bucket sort
JavaScript, Algorithm
Sorts an array of numbers, using the bucket sort algorithm.
Quick sort
JavaScript, Algorithm
Sorts an array of numbers, using the quicksort algorithm.