An analyst is using a linear search algorithm to find an item in an unordered list containing n n\,n elements.
Give the best-case and worst-case scenarios in terms of the number of comparisons required to find the target item.
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.