3.1 Fundamentals of AlgorithmsVery High Exam FrequencyOCR

Linear Search

Revise Linear Search in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 8 flashcards. This is a very high-frequency exam topic, so it is worth revising until the core ideas feel automatic.

Study this topic

Video Lesson

Notes 2

Finding the Needle

Introduction 3

Linear Search vs Binary Search Comparison

Diagram 4

Comparison

Notes 5

Deep Dive: Binary Search Steps

Notes 6

Memory Trick

Notes 7

Exam Tips

Notes 8

Knowledge Organiser: Linear Search and Binary Search

Summary

Sample Flashcards

What does linear search do?

Checks each item from start to end until found

What does binary search require?

Data must be sorted

Exam questions for Linear Search

How does a linear search work?

A. It divides the list in half repeatedly until the item is found
B. It checks each element in the list one at a time, from start to end
C. It sorts the list first, then jumps directly to the target item
D. It starts from the middle of the list and works outwards

1 markfoundation

Describe how a linear search works on a list of n items. [3 marks]

3 marksstandard

exam-style questions

revision flashcards

Ready to revise Linear Search?

Get personalised daily study plans, adaptive quizzes, and spaced repetition flashcards.

Start revising free

Previous topic

Trace Tables

Next topic

Bubble Sort