An automated astronomical telescope uses a binary search algorithm to locate a target star by its catalogued right ascension coordinate from a database.
State the fundamental condition that the database of coordinates must satisfy in order for the binary search algorithm to function correctly.
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.