InsertionSort
123456789101112131415161718192021222324252627282930313233343536
const numbers = [99, 44, 6, 2, 1, 5, 63, 87, 283, 4, 0];
function insertionSort(array) {
let length = array.length;
let lastSortedIndex = 0;
for(let i = 1; i < length; i++) {
let curr = array[i];
if(curr < array[lastSortedIndex]) {
for(let j = 0; j <= lastSortedIndex; j++) {
if(curr < array[j]) {
if(j === lastSortedIndex) {
array[i] = array[j];
array[j] = curr;
break;
}
else {
let replacedIndex = i;
let replacingIndex = lastSortedIndex;
while(replacingIndex>=j) {
array[replacedIndex] = array[replacingIndex];
replacedIndex--;
replacingIndex--;
}
array[j] = curr;
break;
}
}
}
}
lastSortedIndex++;
}
}
insertionSort(numbers);
console.log(numbers);
JavaScript
INFO