Memory Trick

Part of Linear Search · Section 6 of 8

Study NotesUnit: 3.1 Fundamentals of AlgorithmsGCSE

Linear = Like reading a Line from start to end
Binary = Bi means two - keep splitting in two halves

This study notes covers Memory Trick within Linear Search for GCSE Computer Science. Revise Linear Search in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 8 flashcards. This topic shows up very often in GCSE exams, so students should be able to explain it clearly, not just recognise the term. It is section 6 of 8 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.

Practice 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

Quick recall flashcards

What does binary search require?

Data must be sorted

What does linear search do?

Checks each item from start to end until found

Deep Dive: Binary Search Steps

Exam Tips

15 questions on Linear Search: practise free

Instant marking, adaptive difficulty and spaced-repetition flashcards — all aligned to your exam board.

Start revising free →