Sorting Algorithms

sorting.js

const insertionSort = (arr) => {
    for( let i = 1; i < arr.length; i++) {
        const tmp = arr[i]
        let j = i - 1
        while( j >= 0 && arr[j] > tmp ) {
           arr[j + 1] = arr[j]
           i--
        }
        arr[j + 1] = tmp
    }
    return arr
}

const selectionSort = (arr) => {
    let mi
    for(let i = 0; i < arr.length; i++) {
        mi = i
        for(let j = i + 1; j < arr.length; j++) {
            if(arr[j] < arr[mi]) {
                mi = j
            }
        }
        [arr[i], arr[mi]] = [arr[mi], arr[i]]
    }
    return arr
}

usage.js

const genRandArr = (num) => Array.from({length: num}, () => Math.floor(Math.random() * 100))

const num = 10000

const randomList1 = genRandArr(num)
const randomList2 = genRandArr(num)

console.time("Insertion sort: ")
insertionSort(randomList1)
console.timeEnd("Insertion sort: ")

console.time("Selection sort: ")
selectionSort(randomList2)
console.timeEnd("Selection sort: ")