Explore
Quiz: Identifying Search/Sort Algorithms from Code or Pseudocode
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 Learning
Students also studied
Browse allSteps in this lesson (11)
Building on what you've learned about search and sort algorithms, let's test your knowledge of identifying them from code or pseudocode!
Which sorting algorithm repeatedly swaps adjacent elements if they are in the wrong order?
Start the lesson to answer this multiple choice question
Which of the following are characteristics of the binary search algorithm? (Select all that apply)
Start the lesson to answer this multi-select question
The {{blank0}} algorithm works by dividing the list into smaller sub-lists, sorting them, and then combining them.
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
Match the items on the left with their correct pairs on the right
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
Which algorithm is based on repeatedly dividing a list into halves to find an item?
Start the lesson to answer this multiple choice question
Match the items on the left with their correct pairs on the right
Match the items on the left with their correct pairs on the right
Start the lesson to answer this matching question
Binary search only works on {{blank0}} lists, because it relies on dividing them into {{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