Euclid's algorithm
- algorithms
Euclid’s Elements, compiled around 300 BCE in the Greek mathematical tradition, presents a procedure for finding the greatest common divisor of magnitudes or numbers. Repeatedly reducing the larger by the smaller preserves the common divisor until the process reaches a terminating case. Later formulations use division and remainders to perform the same underlying reduction efficiently. The procedure is a classic example of an algorithm whose correctness can be explained through an invariant. Its surviving written form predates electronic computing by more than two millennia, showing that systematic computation is older than the machines now associated with the term. **Timeline anchor:** 1 July 300 BCE. Approximate: about 300 BCE. **References:** [Source 1](https://en.wikipedia.org/wiki/Euclidean_algorithm).