![]() |
|||
|
About Article
Alternative to Fast Greatest Common Divisor (GCD) Algorithm
Hi, everybodyAfter thorough consideration, I would not recommend the Alternate 2 method for the following reasons:1. First and foremost, the computational efficiency of the Euclid's algorithm at the core of my function(see the following - ORIGINAL, RECOMMENDED): // fast Euclid...
|
||||||||||||||