Computer Science / Unit 3 CS 0118 short lesson, about 20 seconds
Algorithmic Problem-Solving
Captions available
The idea
An algorithmic problem always has a brute answer — input sizes are finite, so exhaustive search exists — which makes efficiency, in time or in space, the actual goal of the field.
In practice
Generations of computer scientists have kept solved problems open by asking for faster solutions.
Where people slip
"Solvable" and "solvable in time" are different claims.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Something wrong in this lesson? Flag it · Sources for Computer Science