Practice Recursive Formulation (12.1.5) - Insertion Sort - Design & Analysis of Algorithms

Practise this section

8 questions

Flashcard drill
3 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.
Explain the basic principle of insertion sort.
Show hintHide hint
Think about how one would sort playing cards.
Question 2.
What is the time complexity of insertion sort in the worst case?
Show hintHide hint
Consider the number of comparisons needed in the worst-case scenario.
3Question 3.
What is the main idea behind insertion sort?
- To compare all elements at once
- To build a sorted array incrementally
- To sort without comparisons
Show hintHide hint
Think about how the algorithm progresses with each element.
4Question 4.
Is insertion sort efficient for small datasets?
- True
- False
Show hintHide hint
Think about the ease of inserting few elements.
Question 5.
Write a function that sorts an array using the recursive insertion sort approach and explain your thought process.
Show hintHide hint
Think through how to keep your base case clear and how to recursively sort the smaller elements.
Question 6.
Given a nearly sorted array, explain how insertion sort's efficiency changes and provide a justification.
Show hintHide hint
Reflect on how comparisons are reduced in already sorted data.

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