Binary Search (AQA GCSE Computer Science): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What are searching algorithms used for?
What are searching algorithms used for?
To find specific info in data
What else can searching algorithms confirm?
What else can searching algorithms confirm?
Something is not present in data
How does linear search work?
How does linear search work?
Checks items one by one from start
What is linear search sometimes called?
What is linear search sometimes called?
Sequential search
What is the crucial requirement for binary search?
What is the crucial requirement for binary search?
List must be sorted in order
What strategy does binary search use?
What strategy does binary search use?
Divide and conquer
What does binary search do with the middle value?
What does binary search do with the middle value?
Compares it with target value
How many comparisons might linear search need for 1 million items?
How many comparisons might linear search need for 1 million items?
1 million comparisons
How many comparisons does binary search need maximum for 1 million items?
How many comparisons does binary search need maximum for 1 million items?
21 comparisons
When should you use linear search?
When should you use linear search?
When data is not sorted
When should you use binary search?
When should you use binary search?
When data is already sorted
Why is binary search so much faster?
Why is binary search so much faster?
It halves the search space each time