function insertionSort(arr){
for(n = 1; n < arr.length; n++){
let current = arr[n];
let j = n - 1;
while(j >= 0 && arr[j] > current){
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = current;
}
return arr;
}
let sortedArray = insertionSort([5,13,4,7,8]);
console.log("insertion sort");
console.log(sortedArray);
console.log("\n");
function selectionSort(arr) {
for(let n = 0; n < arr.length; n++) {
let min = n;
for(let j = n+1; j < arr.length; j++){
if(arr[j] < arr[min]) {
min=j;
}
}
if (min !== n) {
let current = arr[n];
arr[n] = arr[min];
arr[min] = current;
}
}
return arr;
}
let sortedArray2 = selectionSort([5,13,4,7,8]);
console.log("selection sort");
console.log(sortedArray2);
