1
$\begingroup$

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

  • 0
    Consider the both the numbers to be a 100 digits in length each (both are integers ofcourse)2011-02-12

1 Answers 1

2

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.)