Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor)
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference ==")
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