Algorithm Efficiency Flashcards

1️⃣ Familiarise yourself with the flashcards:

Look through all the flashcards to see what's on both sides.
Make sure you understand the information on each card. If something's unclear, click the link to the revision notes at the bottom of the page for more details.

2️⃣ Test yourself:

Look at the question or prompt on each card and try to remember the answer before flipping it over.
Check the answer and make a note of any cards you find challenging and need to go over more.

3️⃣ Consistently Review and Practice:

Use spaced repetition: spend more time on the cards you struggle with and go over them more often.
Regularly review all the flashcards to help you better understand and retain the information over time.

Note: We may include questions that have multiple correct answers. It's useful to remember specific examples to understand these concepts better.

PERSONALISED 1-TO-1 TUTORING

Get support with clear explanations, practice and feedback (Ages 5 to 16).

Want an ad-free experience? Subscribe to remove ads

What does algorithm efficiency mean?

How many steps and how much memory an algorithm needs.

Time efficiency (number of steps) and space efficiency (memory used).

The amount of data the algorithm works on.

Count the basic steps and see how the count grows with input size.

The fewest steps it needs on the easiest input.

The most steps it might need on the hardest input.

Use the same input size and compare how many steps each needs. The one with fewer steps is more efficient.

It runs faster, uses less memory, and can handle bigger data sets.

The number of steps stays the same, whatever the input size.

Steps go up roughly in line with input size.

Steps go up like input size squared.

Linear: about double. Quadratic: about four times.