SOURCE

const insertionSort = array => {
    const {length} = array
    for (let i = 1; i < length; i++) {
        let prevIndex = i - 1
        let currentVal = array[i]
        while(prevIndex >= 0 && array[prevIndex] > currentVal) {
            array[prevIndex + 1] = array[prevIndex]
            prevIndex--
        }
        array[prevIndex + 1] = currentVal
    }
    return array
}

console.log(insertionSort([3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]))