Free November promotion: everything is free until 30 November 2026 — every subject, unlimited practice.
Subjects / LC Computer Science / Strand 2: Core concepts

Searching algorithms

Linear search and binary search: how they work and when each is suitable.

In review 5th Year6th Year HigherOrdinary
Helps to know first: Strings, lists and dictionaries
15practice questions

Match the pairs: 1 · Multiple choice: 5 · Select all that apply: 2 · Numeric answer: 4 · Put in order: 2 · Written answer (self/teacher assessed): 1

Each question has up to three hints, a worked explanation, and is tracked in your progress and review plan.

Practise this topic

Try a question

Numeric answer
A linear search checks a list of 431 unsorted items one at a time from the start. In the worst case, how many comparisons does it make?
Whole numbers, decimals (2.5) or fractions (3/4).
Hint 1

Worst case: the item is last or not there at all.

Create a free account to save your progress.