Last updated on Sep 20, 2026

Algorithms (OCR A-Level Computer Science): Quizzes

📚Quizzes

Revision Notes Model Answers Quizzes Flashcards Exam Questions

Algorithm Efficiency using Big O Notation

Sign up to keep practising.Create a free account to play more quizzes and track your progress.

Practise the questions

13 questions from this quiz

Show

What does Big O notation express about an algorithm?

The upper bound of growth rate

What type of scenario does Big O notation describe?

Worst-case scenario

What does time complexity measure?

How execution time increases with input

What is the complexity of accessing an array element by its index?

$O(1)$

Which algorithm has $O(\log n)$ complexity?

Binary search

How does linear complexity $O(n)$ appear on a graph?

A straight line with constant slope

What is the Big O complexity of Bubble sort?

$O(n^2)$

How does exponential complexity $O(2^n)$ change with each additional input element?

Performance doubles

How does constant complexity $O(1)$ appear on a graph?

A flat line

How does logarithmic complexity $O(\log n)$ appear on a graph?

Rises quickly then flattens

What is the complexity of a single loop running $n$ times?

$O(n)$

What is the complexity of a nested loop over $n$ ?

$O(n^2)$

How does $n + \log n$ simplify in Big O notation?

$O(n)$

Explore OCR A-Level Computer Science Revision Notes by Topics

Algorithms

Algorithms for the Main Data Structures

Explore OCR A-Level Computer Science Model Answers by Topics

Algorithms

Algorithms for the Main Data Structures

Explore OCR A-Level Computer Science Flashcards by Topics

Algorithms

Algorithms for the Main Data Structures

Explore OCR A-Level Computer Science Exam Questions by Topics

Algorithms

Algorithms for the Main Data Structures

Join 100,000+ A-Level students studying Quizzes with us.

Select your subjects, and get access to A+ resources today.