JavaScript Insertion Sort

insertionSort.ts

const arr = [10,11,13,5,6,6,2]

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

console.log(insertionSort(arr))