This laboratory exercise explores the insertion sort as a mechanism to order numbers on a list.
Many applications require the maintenance of ordered data.
Given such a list, two common operations involve inserting an item into the list or removing an item from the list. If the item is not present on the list, return an error. In your code, use the ordering of the list to minimize the amount of searching through the list. Insertion Sort One approach to sort a list incorporates the above insertion process. Write a few sentences explaining how this code works.