Insertion Sort is a technique that works by utilizing a sorted sublist and continuously adding a value to it from the unsorted list until the whole list is sorted. The algorithm begins with the first list item as the sorted sublist. It then compares the next number with the first. If it’s greater, then it’s inserted