12.1.1. Introduction to Insertion Sort

Try these first

1. 1.

   What is the first step in Insertion Sort when starting with the array [7, 2, 4, 1]?

   Hint

   Think about how the first element is treated.

2. 2.

   What happens if we try to sort the array [3, 1, 2] with Insertion Sort?

   Hint

   Consider the order of placement.

3. 3.

   What is one characteristic of Insertion Sort?

   • It sorts by swapping only
   • It builds a sorted section iteratively
   • It is recursive by nature

   Hint

   Recall how the algorithm operates over time.

4. 4.

   True or False: Insertion Sort works best with large datasets.

   • True
   • False

   Hint

   Consider the dataset size and sorting efficiency.

5. 5.

   Given an array of elements representing scores [67, 85, 92, 70, 88], perform Insertion Sort by hand, showing each step.

   Hint

   Process each score through the sorted and unsorted areas.

6. 6.

   Perform a complexity analysis of Insertion Sort for the worst, average, and best cases and explain your findings.

   Hint

   Understand the impact of element arrangements on time complexity.