Practice Recursion Analysis (12.1.6) - Insertion Sort - Design & Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
4 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What does Insertion Sort do?
Show hintHide hint
Think about how you sort cards in your hand.
Question 2.
Define time complexity.
Show hintHide hint
Consider how the time increases with more data.
3Question 3.
What is the time complexity of Insertion Sort?
- O(n)
- O(n log n)
- O(n^2)
Show hintHide hint
Consider how many comparisons you might have to make with reversed data.
4Question 4.
True or False: Insertion Sort can be faster than selection sort on nearly sorted lists.
- True
- False
Show hintHide hint
Think about how well it handles existing order.
Question 5.
Implement Insertion Sort in a programming language of your choice, both iteratively and recursively. What differences do you observe in performance?
Show hintHide hint
Focus on measuring the execution time with varying list sizes.
Question 6.
Create an input case for Insertion Sort that highlights its worst-case time complexity. Explain your reasoning.
Show hintHide hint
Think about how selections each time for the next element will be maximum.

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