insertion sort algorithm js code example
Example 1: insertion sort javascript
let insertionSort = (inputArr) => {
for (let i = 1; i < inputArr.length; i++) {
let key = inputArr[i];
let j = i - 1;
while (j >= 0 && inputArr[j] > key) {
inputArr[j + 1] = inputArr[j];
j = j - 1;
}
inputArr[j + 1] = key;
}
return inputArr;
};
Example 2: javascript insertion sort
const insertionSort = array => {
const arr = Array.from(array);
for (let i = 1; i < arr.length; i++) {
for (let j = i; j > 0 && arr[j] < arr[j - 1]; j--) {
[arr[j], arr[j - 1]] = [arr[j - 1], arr[j]];
}
}
return arr;
};
console.log(insertionSort([4, 9, 2, 1, 5]));