MAKE IT YOURS
A world for every learner
Choose a grade to discover its colours and creative world.
Grade 12 Algorithm Efficiency (Big-O) Worksheet with Answers
Grade 12 (US) · Year 13 (UK) · Class 12 (India) · Computer Science
Unit 1: AlgorithmsEfficiencyCSTA 3B-AP-11
Comparing how the number of steps grows: O(1), O(log n), O(n) and O(n²). This free high school worksheet has 12 questions and a full answer key. Print it or save it as a PDF — every answer is checked by code, not guessed.
- Answer keys checked by code
- No ads, ever
- No student accounts needed
- Safety & privacy
Practice Sheetaethelsystems.comAlgorithm Efficiency (Big-O)
Grade 12 · Computer Science
Name
Class
Date
Learning goal: Efficiency · CSTA 3B-AP-11
Directions: Read each question carefully and write your answer on the line. Use the diagram to help you.
RememberHow fast do steps grow?
- 1
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 2
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 3
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 4
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 5
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 6
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 7
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 8
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 9
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 10
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 11
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
- 12
What is the time complexity of this code? Choose O(1), O(log n), O(n) or O(n²).
★ Challenge corner for fast finishers
In a list of every 2-bit pattern, how many patterns have exactly one 1?
How did I do?
Teacher's comments
Free printable worksheets with answer keys · aethelsystems.com/worksheets/computer/12/big_o
Answer key — Algorithm Efficiency (Big-O) (Grade 12)
- 1.O(1)
- 2.O(n)
- 3.O(n)
- 4.O(log n)
- 5.O(n²)
- 6.O(n²)
- 7.O(1)
- 8.O(log n)
- 9.O(n)
- 10.O(n²)
- 11.O(n²)
- 12.O(log n)
- ★2
Answer key (click to show)
- 1.O(1)
- 2.O(n)
- 3.O(n)
- 4.O(log n)
- 5.O(n²)
- 6.O(n²)
- 7.O(1)
- 8.O(log n)
- 9.O(n)
- 10.O(n²)
- 11.O(n²)
- 12.O(log n)
- ★2 (challenge corner)
Need another Algorithm Efficiency (Big-O) worksheet?
Generate unlimited fresh versions at easy, medium or hard difficulty, each with its own answer key. Free during our launch — no card needed.
Create a free accountHow to use this worksheet
- Use it for revision before a test, as homework, or as a timed practice set.
- Students can self-mark with the answer key and note which question types they got wrong.
- Generate several versions of the same topic for spaced practice in the weeks before an exam.
Related worksheets
Can't find what you need? Tell us which worksheet to make next.
Frequently asked questions
Does this Grade 12 Algorithm Efficiency (Big-O) worksheet come with answers?
Yes. The full answer key is on this page, and it prints on its own page after the questions. Every answer is calculated or checked by code rather than written by an AI model, so the key is always correct.
How do I print it or save it as a PDF?
Click "Download PDF" to save a ready-to-print PDF with the answer key on the last page, or click "Print" to send the worksheet and answer key straight to your printer.
Can I get a different Algorithm Efficiency (Big-O) worksheet?
Yes. Create a free account to generate as many fresh Grade 12 Algorithm Efficiency (Big-O) worksheets as you like, at easy, medium or hard difficulty, each with its own answer key.
Is this worksheet free?
Yes. This worksheet is free to print, and Practice Sheet is free to use during our launch with no card needed.