AlgorithmsIntroduction

Finding the Needle

Part of Linear SearchGCSE Computer Science

This introduction covers Finding the Needle within Linear Search for GCSE Computer Science. 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 be a useful differentiator on mixed-topic papers. It is section 2 of 7 in this topic. Use this introduction to connect the idea to the wider topic before moving on to questions and flashcards.

Topic position

Section 2 of 7

Practice

15 questions

Recall

8 flashcards

Finding the Needle

Looking for something in a list? You have two strategies. Linear search is like looking for a word in a dictionary by starting at page 1 and reading every word - simple but slow. Binary search is how you actually use a dictionary - open to the middle, decide if your word is before or after, then repeat. Binary is MUCH faster, but the dictionary must be alphabetical (sorted)!

Keep building this topic

Read this section alongside the surrounding pages in Linear Search. That gives you the full topic sequence instead of a single isolated revision point.

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

Want to test your knowledge?

PrepWise has 15 exam-style questions and 8 flashcards for Linear Search — with adaptive difficulty and instant feedback.

Join Alpha