Question

Language Javascript

1. Implement Insertion Sort

   1. Non-increasing order,

   2. At least an array of 10 elements.,

   3. You can use a static array.

Answer 1

CODE:-

function insertionSort(arr){

var length = arr.length;

for (let i = 1; i < length; i++) {

var key = arr[i];

var j = i - 1;

while (j >= 0 && arr[j] < key) {

arr[j + 1] = arr[j];

j = j - 1;

}

arr[j + 1] = key;

}

return arr;

};

var a = [4,3,2,1,6,5,1,8,6,7]

console.log("Array before sort: "+a);

a = insertionSort(a)

console.log("Array after sort: "+a);

OUTPUT:-

NOTE:- If you have any doubts, please comment below. THANK YOU!!! Please give positive rating.