삽입정렬

const arr = [5, 1, 2, 9, 7, 4, 3];

function insertionSort(arr) {
    const len = arr.length;

    for (let i = 1; i < len; i++) {
        for (let j = i; 0 < j; j--) {
            if (arr[j] < arr[j - 1]) {
                let temp = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = temp;
            } else {
                break;
            }
        }
    }
}

insertionSort(arr);

console.log(arr);