### Notes on Algorithms 3, Insertion Sort

Insertion Sort is yet another way to sort a list in ascending order just like we did with Selection Sort last week. Similar to selection sort, it will keep comparing the current value with other items and place it when it finds a suitable position. Given an array of unsorted integers, it will divide the list in 2 sections. The sorted left array and the unsorted right array. It will take the 1th item of the array as the key (or the right index) to make the comparisons. Since we start with the only one item in the left, we …

Read More