Insertion Sort Algorithm Worksheet
This worksheet focuses on understanding and applying the Insertion Sort algorithm, a fundamental sorting technique in computer science and mathematics, suitable for Grade 10 students.
Includes
Standards
Topics
Insertion Sort Algorithm Worksheet
Name:
Date:
Score:
Read each question carefully and follow the instructions to demonstrate your understanding of the Insertion Sort algorithm.
1. Which of the following best describes the Insertion Sort algorithm?
It divides the list into two halves and sorts them recursively.
It builds the final sorted array (or list) one item at a time.
It repeatedly swaps adjacent elements if they are in the wrong order.
It selects the smallest element from the unsorted part and places it at the beginning.
2. What is the worst-case time complexity of Insertion Sort?
O(n log n)
O(n)
O(n^2)
O(log n)
1. Insertion Sort is an sorting algorithm, meaning it sorts elements in place.
2. In Insertion Sort, the array is conceptually divided into a sorted and an part.
3. The algorithm iterates, taking elements from the unsorted part and inserting them into their correct position in the part.
1. Describe the basic idea behind the Insertion Sort algorithm in your own words.
2. Explain why Insertion Sort is considered an 'in-place' sorting algorithm.
Trace the execution of the Insertion Sort algorithm for the following array. Show the state of the array after each pass (iteration).
Array: [8, 3, 5, 1, 9]
Initial Array: [8, 3, 5, 1, 9]
Pass 1:
Pass 2:
Pass 3:
Pass 4:
Sorted Array:
1. Insertion Sort is generally efficient for large datasets.
True
False
2. In the best-case scenario (already sorted array), Insertion Sort has a time complexity of O(n).
True
False