I'm looking for what the title says. Euclidean algorithm works and is fast for just a pair of numbers, but I don't see any obvious generalizations. A quick googling didn't turn up anything too ...

The Euclidean algorithm offers a recipe for finding the greatest common divisor of two whole numbers. Suppose the given numbers are 12 and 18.