The oldest algorithm

A 2,300-year-old algorithm still runs today.

Euclid described a repeatable way to find the greatest common divisor of two numbers: replace the larger number by the remainder, then repeat.

The Euclidean algorithm is still used in cryptography and computer algebra.