// 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([5, 6, 2, 1, 3], 5));
Ly8geW91ciBjb2RlIGdvZXMgaGVyZQoKZnVuY3Rpb24gaW5zZXJ0aW9uU29ydChhcnIsIG4pIHsKCWZvcihsZXQgaT0xO2k8bjtpKyspewoJCWxldCBrZXkgPSBhcnJbaV07CgkJCgkJbGV0IGo9aS0xOwoJCXdoaWxlKGo+PTAgJiYgYXJyW2pdPmtleSkgewoJCQlhcnJbaisxXSA9IGFycltqXTsKCQkJai0tOwoJCX0KCQlhcnJbaisxXSA9IGtleTsKCX0KCXJldHVybiBhcnI7Cn0KCmNvbnNvbGUubG9nKGluc2VydGlvblNvcnQoWzUsIDYsIDIsIDEsIDNdLCA1KSk7