Fastest way to compute HCF of 2 numbers

I want a very quick non recursive method for finding the HCF (Highest Common Factor) of 2 very large numbers

-
How large are your very large numbers? –  TonyK Feb 11 '11 at 21:13
Consider the both the numbers to be a 100 digits in length each (both are integers ofcourse) –  Guanidene Feb 12 '11 at 6:36
add comment

1 Answer

For example, http://www.lysator.liu.se/~nisse/archive/sgcd.pdf gives a discussion of sub-quadratic methods for finding the GCD (in particular Schoenhage's algorithm.)

-
add comment