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

Algorithm efficiency and complexity

Counting steps, best/worst case and comparing algorithms with Big-O style reasoning.

In review 6th Year Higher
15practice questions

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

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

Multiple choice
Which expression best describes how the worst-case number of comparisons in a binary search grows with the number of items n?
Choose one answer
Hint 1

How many extra comparisons are needed if you double the size of the list?

Create a free account to save your progress.