Fast vs Slow: How Smart Is Your Plan?
A friendly first look at why some solutions are much faster than others
- explain what "efficiency" means in simple words,
- tell the difference between a fast plan and a slow plan,
- read a simple growth chart and name three speeds: same-work, one-by-one, and much-more.
1. Same answer, different speed
Imagine you drop a box of 100 crayons on the floor. You want to find the red one. You could pick up crayons one at a time and check each colour. Or a friend could hand you a box where the crayons are already sorted by colour, so you go straight to the reds.
Both plans find the red crayon. But one takes many more steps than the other. In computing we call a set of clear steps that solves a problem an algorithm. The same problem can have a fast algorithm and a slow algorithm. Efficiency means: how much work does the plan need to do?
2. Count the steps, not the seconds
A fast computer and a slow computer finish in different times, so seconds can trick us. Instead, programmers count steps — how many little actions the plan does. Counting steps works on any computer.
The important question is not "how long for 10 things?" It is: "what happens when the number of things gets much bigger?" If you have 10 crayons, checking one-by-one is fine. If you have 1,000,000 crayons, one-by-one could take all day, while a smart plan still finishes in a blink.
The special way programmers talk about "how the number of steps grows as the data grows" has a nickname: Big-O. You do not need any hard math — think of it as a label that says fast, medium, or slow as things get bigger.