function insertionSort(input) {
   let activeNumber;
   for (let i = 1; i < input.length; i++) {
       activeNumber = input[i];
       
        for (int j = i - 1; j >= 0; j--) {
            if (input[j] > activeNumber) {
               input[j+1] = input[j];
            } else {
               break;
            }
        }
        input[j+1] = activeNumber;
    }
}