Back to the full dot-point answer
EnglandComputer ScienceQuick questions
3.1 Fundamentals of algorithms
Quick questions on Searching algorithms: linear and binary search - AQA GCSE Computer Science
2short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is q1?Show answer
State one condition that must be true for a binary search to work. [1 mark]
What is q2?Show answer
A list has 1024 sorted items. State the maximum number of items a binary search must check. [1 mark]
Have a question we have not covered?
This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.