I want a very quick non recursive method
for finding the HCF (Highest Common Factor) of 2 very large numbers
Fastest way to compute HCF of 2 numbers
1
$\begingroup$
algorithms
-
0How large are your very large numbers? – 2011-02-11
-
0Consider the both the numbers to be a 100 digits in length each (both are integers ofcourse) – 2011-02-12