A global logistics database containing 64 million active shipping container records is sorted alphabetically by their unique container identification codes.
Explain why a binary search algorithm is more efficient than a linear search algorithm when locating a specific container record in this database. Your answer must include a quantitative comparison of the maximum number of comparisons required by each algorithm.
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.