Insertion Sort

function InsertionSort(arr,size) {
for(let i=1;i<size;i++){
let swap=arr[i]
let j=i-1;
while(j=>0){
if(arr[j]>swap){
arr[j+1]=arr[j]
}else{
break;
}
j--;
}
arr[j+1]=swap

}
return arr
}

const arr=[9,2,4,1,5,7]
console.log(InsertionSort(arr,arr.length))