function insertionSort(arr: number[]) {
    for (let i = 1; i < arr.length; i++) {
        const val = arr[i]

        let j = i - 1

        while (j >= 0 && arr[j] > val) {
            arr[j + 1] = arr[j]
            j--
        }

        arr[j + 1] = val
    }

    return arr
}


console.log(insertionSort([ 9, 3, 6, 2, 1, 11 ]))