✨ Free preview
📈
Algorithm complexity
Describe how running time grows as the input gets bigger, and compare constant, linear and quadratic algorithms.
⏱ 20 min❓ 8 questions
What you'll be able to do
- ✔I can count the steps an algorithm makes as a function of input size n
- ✔I can classify algorithms as constant, linear or quadratic
- ✔I can predict how running time changes when the input doubles or triples
How this works
- 1Read the short explanations first — they teach you what you need before each question.
- 2Answer each question, then tap Check. A right answer moves you on automatically; if it's wrong, you'll see a friendly explanation of why.
- 3Finish all 3 steps to see your score — sign in and subscribe to unlock the full lesson and save it.
What's inside
8 questions and 1 quick teaching card, including:
- 🔗Match the pairs — Choose the partner that goes with each item.
- 🔢Number answer — Work out the answer and type the number.
👪Grown-up tip: sit alongside younger learners for the first few lessons. Read the questions together and chat about the explanations — that's where the real learning sticks.
Sign in and subscribe to unlock the full lesson and save your progress.
Curriculum: AC9TDI10P05