Quiz: Insertion Sort - How It Works
OCR GCSE J277 Computer Science specification
Ready to start this lesson?
Sign in to track your progress. 11 steps including 9 interactive questions.
Sign In to Start LearningStudents also studied
Browse allSteps in this lesson (11)
Building on what you've learned about sorting algorithms like Bubble Sort, let's test your knowledge of Insertion Sort!
What does Insertion Sort do at each step?
Start the lesson to answer this multiple choice question
Which of the following are true about Insertion Sort? (Select all that apply)
Start the lesson to answer this multi-select question
Insertion Sort works by dividing the list into a {{blank0}} portion and an {{blank1}} portion.
Start the lesson to answer this fill in the blank question
Match the items on the left with their correct pairs on the right
Start the lesson to answer this matching question
How many comparisons are needed to sort a list of 4 elements using Insertion Sort in the worst case?
Start the lesson to answer this math equation question
Match the items on the left with their correct pairs on the right
Start the lesson to answer this code completion question
Match the items on the left with their correct pairs on the right
What is the time complexity of Insertion Sort in the worst case?
Start the lesson to answer this multiple choice question
Which of the following lists would be ideal for Insertion Sort? (Select all that apply)
Start the lesson to answer this multi-select question
The worst-case time complexity of Insertion Sort is {{blank0}}, while its best-case time complexity is {{blank1}}.
Start the lesson to answer this fill in the blank question
Want to Learn More?
Get personalised lessons, quizzes, and instant feedback from your AI tutor.
Explore More Topics