// your code goes here
function insertionSort(arr) {
let n = arr.length;
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([13, 2, 5, 1, 4]))
Ly8geW91ciBjb2RlIGdvZXMgaGVyZQpmdW5jdGlvbiBpbnNlcnRpb25Tb3J0KGFycikgewoJbGV0IG4gPSBhcnIubGVuZ3RoOwoJZm9yKGxldCBpPTE7aTxuO2krKyl7CgkJbGV0IGtleV9lbGVtZW50ID0gYXJyW2ldOwoJCQoJCWxldCBqID0gaS0xOwoJCXdoaWxlKGo+PTAgJiYgYXJyW2pdID4ga2V5X2VsZW1lbnQpIHsKCQkJYXJyW2orMV0gPSBhcnJbal07CgkJCWotLTsKCQl9CgkJYXJyW2orMV0gPSBrZXlfZWxlbWVudDsKCX0KCXJldHVybiBhcnI7Cn0KCmNvbnNvbGUubG9nKGluc2VydGlvblNvcnQoWzEzLCAyLCA1LCAxLCA0XSkp