Practice Insertion Sort (12.1) - Insertion Sort - Design & Analysis of Algorithms

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the first step in Insertion Sort?
Show hintHide hint
Think about which element you start with.
Question 2.
How do you find where to insert an element?
Show hintHide hint
Use backward comparison.
3Question 3.
What is the best-case time complexity of Insertion Sort?
- O(n)
- O(n^2)
- O(log n)
Show hintHide hint
Think about how many comparisons are made in a sorted array.
4Question 4.
True or False: Insertion Sort can be implemented iteratively?
- True
- False
Show hintHide hint
Recall how you can loop through elements.
Question 5.
Analyze the performance of Insertion Sort for various inputs: completely unsorted, completely sorted, and reverse sorted arrays. Discuss how each scenario affects the time complexity.
Show hintHide hint
Consider the comparisons and shifts needed for each case.
Question 6.
Write a performance comparison between Insertion Sort and Quick Sort on the basis of average runtime across 10,000 random numbers.
Show hintHide hint
Think about how swaps and partitioning differ in handling elements in these sorts.

4 more questions in this section. Enroll free to practise them all.