Insertion Sort javascript 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]));
Example 3: Insertion Sort javascript
const insertionSort = (inputArr) => {
const {length} = inputArr;
const retArray = inputArr;
for (let i = 1; i < length; i++) {
const key = inputArr[i];
let j = i - 1;
while (j >= 0 && inputArr[j] > key) {
retArray[j + 1] = inputArr[j];
j -= 1;
}
retArray[j + 1] = key;
}
return retArray;
};
insertionSort([10, 9, 8, 7, 6, 5, 4, 3, 2, 1])
Example 4: insertion sort js
let insertionSort = (inputArr) => { let length = inputArr.length; for (let i = 1; i < 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 5: array sorting javascript insertion sort
function insertionSort(inputArr) {
let n = inputArr.length;
for (let i = 1; i < n; i++) {
let current = inputArr[i];
let j = i-1;
while ((j > -1) && (current < inputArr[j])) {
inputArr[j+1] = inputArr[j];
j--;
}
inputArr[j+1] = current;
}
return inputArr;
}