lesson
Updated 6 days ago · 1 view
Every time your phone maps a route, sorts a playlist, or compresses an image, it follows a precise set of instructions behind the scenes.
An algorithm is a finite, step-by-step sequence of unambiguous instructions designed to solve a specific problem or perform a computation.
The term comes from the 9th-century Persian mathematician Muhammad ibn Musa al-Khwarizmi, whose pioneering work on arithmetic introduced systematic algebraic rules to the world.
📊Interactive diagram
How do computer scientists distinguish a valid algorithm from a vague set of human directions?
Properties of a Well-Defined Algorithm
A valid algorithm must satisfy five core properties established by computer scientist Donald Knuth:
• Finiteness: It must always terminate after a countable number of steps, never running in an endless loop.
• Definiteness: Every step must be clear and completely unambiguous, leaving zero room for interpretation.
• Input & Output: It accepts zero or more well-defined inputs and produces at least one meaningful output.
• Effectiveness: Every operation must be simple and feasible enough to execute on physical hardware in finite time.
📊Interactive diagram
Can we test these five properties on a real mathematical procedure?
Worked Example: The Euclidean Algorithm
Around 300 BCE, the Greek mathematician Euclid designed a method to compute the greatest common divisor (GCD) — the largest positive integer that divides two integers without a remainder.