-
Notifications
You must be signed in to change notification settings - Fork 0
/
selection-sort.js
36 lines (30 loc) · 898 Bytes
/
selection-sort.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
const { swap } = require('./sorting-common');
// tag::sort[]
/**
* Selection sort - Look for smaller numbers on the right side
*
* It starts from the first element (index 0),
* and tries to find any element (to the right)
* that could be smaller than the current index.
* If it finds one, it will swap the positions.
*
* Runtime: O(n^2)
* @param {Array|Set} collection elements to be sorted
*/
function selectionSort(collection) {
const array = Array.from(collection); // <1>
for (let left = 0; left < array.length; left++) { // <2>
let selection = left; // <3>
for (let right = left + 1; right < array.length; right++) {
if (array[selection] > array[right]) { // <4>
selection = right; // <5>
}
}
if (selection !== left) {
swap(array, selection, left); // <6>
}
}
return array;
}
// end::sort[]
module.exports = selectionSort;