Insertion Sort

const insertionSort = (arr) => {
    for(let i = 1; i < arr.length; i++) {
        let currentValue = arr[i]
        for(var j = i - 1; j >= 0 && arr[j] > currentValue; j--) {
            arr[j + 1] = arr[j]
        }
        arr[j + 1] = currentValue
    }
    return arr
}
////////or if u dont wanna use var/////
const insertionSort = (arr) => {
   for(let i = 1; i < arr.length; i++) {
       let currentVal = arr[i]
       let j = i - 1
    for(j; j >= 0 && arr[j] > currentVal; j--) {
        arr[j+1] = arr[j]
    }
        arr[j+1] = currentVal
    }
    return arr
}

insertionSort([1,8,16,11,6,3,2,10,45,5,4])