Files
30-seconds-of-code/snippets/selectionSort.md
Isabelle Viktoria Maciohsek 3e1e383386 Update selectionSort.md
2020-12-29 13:04:24 +02:00

28 lines
788 B
Markdown

---
title: selectionSort
tags: algorithm,array,intermediate
---
Sorts an array of numbers, using the selection sort algorithm.
- Use the spread operator (`...`) to clone the original array, `arr`.
- Use a `for` loop to iterate over elements in the array.
- Use `Array.prototype.slice()` and `Array.prototype.reduce()` to find the index of the minimum element in the subarray to the right of the current index and perform a swap, if necessary.
```js
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;
};
```
```js
selectionSort([5, 1, 4, 2, 3]); // [1, 2, 3, 4, 5]
```