23 lines
529 B
JavaScript
23 lines
529 B
JavaScript
|
// https://www.freecodecamp.org/learn/coding-interview-prep/algorithms/implement-insertion-sort
|
||
|
|
|
||
|
|
function insertionSort(array) {
|
||
|
|
// Only change code below this line
|
||
|
|
const swap = (array, i, j) => {
|
||
|
|
const temp = array[i];
|
||
|
|
array[i] = array[j];
|
||
|
|
array[j] = temp;
|
||
|
|
};
|
||
|
|
|
||
|
|
for (let i = 0; i < array.length; i++) {
|
||
|
|
for (let j = i; j > 0; j--) {
|
||
|
|
if (array[j] < array[j - 1]) {
|
||
|
|
swap(array, j, j - 1);
|
||
|
|
} else {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return array;
|
||
|
|
// Only change code above this line
|
||
|
|
}
|