Insertion Sort Algorithm Worksheet
A Grade 11 math worksheet focused on understanding and applying the Insertion Sort algorithm through various question types.
Includes
Topics
Insertion Sort Algorithm
Name:
Date:
Score:
Read each question carefully and provide clear, concise answers. Show all your work for problems requiring calculations or step-by-step explanations.
1. Which of the following is true about Insertion Sort?
It is an in-place sorting algorithm.
Its worst-case time complexity is O(n log n).
It is best suited for large datasets.
It uses a divide and conquer approach.
2. What is the primary operation in Insertion Sort?
Swapping adjacent elements.
Partitioning the array.
Inserting an element into its correct position in a sorted subarray.
Comparing elements at distant positions.
3. Insertion Sort builds the final sorted array (or list) one item at a time by repeatedly taking the next element and inserting it into its correct position among the elements.
4. The best-case time complexity of Insertion Sort is , which occurs when the input array is already sorted.
5. Describe the analogy often used to explain Insertion Sort using a deck of cards.
6. Insertion Sort is generally considered an unstable sorting algorithm.
True
False
7. The space complexity of Insertion Sort is O(1).
True
False
8. Sort the following array using the Insertion Sort algorithm. Show each step of the sorting process by writing the state of the array after each pass.
Array: [8, 2, 4, 1, 3]