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