Quiz: Binary Search - 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 Learning
Students also studied
Browse allSteps in this lesson (11)
Welcome! You've already learned about linear search, flowcharts, and spotting errors in algorithms. Now, let's dive into binary search and test your knowledge!
What is the main difference between binary search and linear search?
Start the lesson to answer this multiple choice question
Which of the following are required for binary search to work? (Select all that apply)
Start the lesson to answer this multi-select question
Binary search starts by comparing the {{blank0}} of the list to the target value. If the target is smaller, it searches in the {{blank1}} half.
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
A sorted list has 16 elements. How many comparisons will binary search need at most to find the target?
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
If binary search is used on a sorted list of 100 elements, how many comparisons are needed at most?
Start the lesson to answer this multiple choice question
Which of the following are advantages of binary search over linear search? (Select all that apply)
Start the lesson to answer this multi-select question
The {{blank0}} search algorithm works by repeatedly dividing a sorted list 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