Show how a binary search algorithm is used to find the number 21 in the following sorted data set:
[3, 6, 9, 12, 15, 18, 21]
Identify the midpoint, compare it to the target value, and show the remaining steps until the target is found.
Practise OCR GCSE Computer Science Searching and sorting algorithms with exam-style questions for GCSE Computer Science. 36 questions, matched to the OCR GCSE Computer Science (J277) specification and written in Component 01 and Component 02 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.