3-insertionSort.js

///////////////////////////////////////////////////////
////////////*** INSERTION SORT QUESTION ***////////////
///////////////////////////////////////////////////////

//1. start by picking the second element in the array
//2. Now compare the second element with the one before it and swap if necessary. 
//3. Continue to the next element and if it is in the incorrect order, iterate through the sorted portion. (i.e. the left side) to place the element in the correct place. 
//4. repeat until the array is sorted. 






console.log(insertion([6,5,4,3,2,1]))
//output: [ 1, 2, 3, 4, 5, 6 ]

//explain this sorting method's big O notation
// time complexity:
// space complexity: