A digital archive contains a sorted list of 127 unique manuscript reference codes. An archivist uses a binary search algorithm to locate a specific code in the list.
State the number of comparisons required in the best-case and worst-case scenarios to either find the target item or confirm it is not present in the list.
159 exam-style questions on Edexcel GCSE Computer Science Algorithms, covering Constructs for solving problems, Variables, constants and data structures, Arithmetic, relational and logical operators, Tracing algorithm output with trace tables, Types of error and correcting logic errors, Standard algorithms (sorts and searches), and Evaluating algorithm fitness and efficiency. Each one has a worked solution and a mark scheme showing where the marks go.