InsertionSort.js

// https://learn.freecodecamp.org/coding-interview-prep/algorithms/implement-insertion-sort

// Algorithms: Implement Insertion Sort
// The next sorting method we'll look at is insertion sort.
// This method works by building up a sorted array at the beginning of the list.
// It begins the sorted array with the first element.
// Then it inspects the next element and swaps it backwards into the sorted array until it is in sorted position.
// It continues iterating through the list and swapping new items backwards into the sorted portion until it reaches the end.
// This algorithm has quadratic time complexity in the average and worst cases.
//
// Instructions: Write a function insertionSort which takes an array of integers as input and
// returns an array of these integers in sorted order from least to greatest.
//

function Logger(number, result) {
    console.log(`#${number} : ${JSON.stringify(result)}`);
}

function insertionSort(array) {
    // change code below this line
    for (let i = 1; i < array.length; i++) {
        for (let j = 0; j < i; j++) {
            if (array[j] > array[i]) {
                const temp = array[i];
                array[i]   = array[j];
                array[j]   = temp;
            }
        }
    }
    // change code above this line
    return array;
}

// test array:
Logger(1, insertionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]));