// your code goes here
function insertionSort(arr, n) {
for(let i=1;i<n;i++) {
let key = arr[i];
let j = i-1;
while(j>=0 && arr[j]>key) {
arr[j+1] = arr[j];
j--;
}
arr[j+1] = key;
}
return arr;
}
console.log(insertionSort([4, 6, 1, 3, 2], 5))
Ly8geW91ciBjb2RlIGdvZXMgaGVyZQpmdW5jdGlvbiBpbnNlcnRpb25Tb3J0KGFyciwgbikgewoJZm9yKGxldCBpPTE7aTxuO2krKykgewoJCWxldCBrZXkgPSBhcnJbaV07CgkJbGV0IGogPSBpLTE7CgkJCgkJd2hpbGUoaj49MCAmJiBhcnJbal0+a2V5KSB7CgkJCWFycltqKzFdID0gYXJyW2pdOwoJCQlqLS07CgkJfQoJCWFycltqKzFdID0ga2V5OwoJfQoJcmV0dXJuIGFycjsKfQoKY29uc29sZS5sb2coaW5zZXJ0aW9uU29ydChbNCwgNiwgMSwgMywgMl0sIDUpKQ==