An unsorted array contains the names of 10 students. A programmer uses a linear search to search for a name that is not present in this array.
Describe the steps the linear search algorithm would take to determine that the name is not in the array.
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.