 The original algorithm was described only for natural numbers and geometric lengths (real numbers), but the algorithm was generalized in the 19th century to other types of numbers, such as Gaussian integers and polynomials of one variable.This led to modern abstract algebraic notions such as Euclidean domains.The Euclidean algorithm calculates the greatest common divisor (GCD) of two natural numbers "a" and "b".