PrepWisePrepWiseComputer Science
AlgorithmsLow Exam FrequencyOCR

Linear Search

Revise Linear Search in Algorithms for GCSE Computer Science with 15 exam-style questions and 8 flashcards. This topic appears less often, but it can still pick up marks when it appears in mixed-topic papers.

Study this topic

1

Video Lesson

Notes2

Finding the Needle

Introduction3

Linear Search vs Binary Search Comparison

Diagram4

Comparison

Notes5

Deep Dive: Binary Search Steps

Notes6

Memory Trick

Notes7

Exam Tips

Notes

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

Sample Questions

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

15

exam-style questions

8

revision flashcards

Ready to revise Linear Search?

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

Join Alpha

Previous topic

Trace Tables

Next topic

Binary Search