An ancient algorithm that efficiently finds all prime numbers up to a given limit by iteratively marking the multiples of each prime.
An ancient algorithm that efficiently finds the greatest common divisor (GCD) of two integers.
