Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$ bits
(Store only the current values being iterated on, and an O(1)-sized matrix with O(n)-bit numbers)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM? words size O(1)
Year
1940