Efficiency of Simple Algorithms (AQA GCSE Computer Science): Flashcards

How well an algorithm performs (time & resources needed)

By counting steps/operations, not actual time

Computers run at different speeds

Different approaches may have very different efficiency levels

Instructions to arrange a list in order (e.g., smallest to largest)

Locates a specific value in a list or confirms it exists

With larger data - small differences become huge time savings

100000 statements vs changing 1 number - loops more efficient

Euclidean more efficient - requires fewer steps

Can lead to massive time savings in real-world applications

No - just because it works doesn't mean it's the best way

Fundamental building blocks - reusable in many programmes