2.1.3 Searching & Sorting Algorithms

• Consider this list of numbers: 9 3 6 8 4 7. After three comparisons have been made the list is 3 6 9 8 4 7. Which algorithm is being applied?

  Insertion sort.
• What is an insertion sort?

  An insertion sort builds the final sorted list one item at a time by placing each data item into the correct position in the list.