// 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, 6, 1, 3], 4))
Ly8geW91ciBjb2RlIGdvZXMgaGVyZQpmdW5jdGlvbiBpbnNlcnRpb25Tb3J0KGFyciwgbikgewoJZm9yKGxldCBpPTE7aTxuO2krKykgewoJCWxldCBrZXlfZWxlbWVudCA9IGFycltpXTsKCQkKCQlsZXQgaj1pLTE7CgkJd2hpbGUoaj49MCAmJiBhcnJbal0+a2V5X2VsZW1lbnQpIHsKCQkJYXJyW2orMV0gPSBhcnJbal07CgkJCWotLTsKCQl9CgkJYXJyW2orMV0gPSBrZXlfZWxlbWVudDsKCX0KCXJldHVybiBhcnI7Cn0KCmNvbnNvbGUubG9nKGluc2VydGlvblNvcnQoWzUsIDYsIDEsIDNdLCA0KSk=