Standard Searching Algorithms (OCR GCSE Computer Science): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
How does a linear search examine items in a list?
How does a linear search examine items in a list?
One by one from the start
What type of list can a linear search be used on?
What type of list can a linear search be used on?
Unsorted lists
What must be done to a list before using binary search?
What must be done to a list before using binary search?
The list must be sorted
What type of algorithm is binary search?
What type of algorithm is binary search?
Divide-and-conquer
In binary search, what do you find first in the list?
In binary search, what do you find first in the list?
The middle item
If the search item is greater than the middle item in binary search, which half do you search?
If the search item is greater than the middle item in binary search, which half do you search?
Right half
Which search is faster for large lists?
Which search is faster for large lists?
Binary search
In list [2, 0, 1, 7, 4, 3, 5], at which position is 7 using linear search?
In list [2, 0, 1, 7, 4, 3, 5], at which position is 7 using linear search?
Fourth position
Which search algorithm is simpler to implement?
Which search algorithm is simpler to implement?
Linear search
Why is linear search slower for large lists?
Why is linear search slower for large lists?
It checks every item one by one
When is binary search the better option?
When is binary search the better option?
Large, sorted lists
When is linear search simpler to use?
When is linear search simpler to use?
Small or unsorted lists
