Linear search
What Linear search means in Computer Science GCSE, as defined for OCR, Pearson Edexcel.
Definitions of Linear search
Exam boards and our study guides word this term in slightly different ways. Learn the version your board uses.
Check what you remember
Read the wording for your board, then hide it and explain Linear search in your own words. Rough notes are fine. This is a self-check, with no mark or grade.
Reference: Pearson Edexcel
Checks each item from the start of a list in turn until the target is found or the list ends, so it works on unsorted data.
Inspects each item in turn from the start until the target is found or the list ends, and works on any list, sorted or not.
Topics that use Linear search
- Searching and sorting algorithms (OCR GCSE)
- Algorithms (Pearson Edexcel GCSE)
Related terms
- Binary search
- Bubble sort
- Merge sort
- Arithmetic operators
- Insertion sort
- Logic error
- Logical operators
- Modulus
Using Linear search in the exam
Check the command word and mark scheme for your exact question. After comparing your explanation with the reference, use the term in an answer on the linked topic. This practice does not predict an exam mark.
Practise Computer Science questions
Create a free account to answer exam-style questions on this topic and get feedback on your answers.
A week of Premium from your first lesson · Then the free plan continues · No card, no charge