Insertion Sort Algorithm

insertion-sort.js

function insertionSort(array) {
    let adım = 1;
    for (let i = 1; i < array.length; i++) {
        var currentValue = array[i]

        for (var j = i - 1; j >= 0 && array[j] > currentValue; j--) {
            array[j + 1] = array[j];
        }

        array[j + 1] = currentValue
        adım++;
    }

    return array;
}


const numberList=[...new Set(Array.from({length: 50}, () => Math.floor(Math.random() * 250)))];
console.log(insertionSort(numberList))