Practice Comparative Performance Of Sorting Algorithms (12.1.7)

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.
What is the first step in the insertion sort algorithm?
Show hintHide hint
Think about how you would position cards when sorting.
Question 2.
In which scenarios does insertion sort perform best?
Show hintHide hint
Consider how sorting affects the number of comparisons made.
3Question 3.
What is the average time complexity of insertion sort?
- O(n)
- O(n log n)
- O(n²)
Show hintHide hint
Recall the lessons on sorting complexities we've covered.
4Question 4.
True or False: Insertion sort can perform faster than selection sort when data is nearly sorted.
- True
- False
Show hintHide hint
Think about how many moves an already sorted array would require.
Question 5.
Given the array [12, 11, 13, 5, 6], describe the steps taken by insertion sort.
Show hintHide hint
Visualize how each number navigates through the sorted section.
Question 6.
How will insertion sort behave if the array is initially sorted? Explain your reasoning.
Show hintHide hint
Consider how many comparisons or movements would occur in the best-case scenario.

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