const insertion_sort = (arr, n) => {
let tmp = 0;
for(let i=1; i<n; i++) {
for(let j=i;j>0;j--) {
if(arr[j-1] > arr[j]) {
tmp = arr[j];
arr[j] = arr[j-1];
arr[j-1] = tmp;
}
}
}
return arr;
}
-시간복잡도: best: O(N) average, worst: O(N^2)