Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1711:17, 15 February 2023‎ Admin talk contribs‎ 352 bytes +352‎ 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 =="
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Lehmer%27s_GCD_algorithm_(Greatest_Common_Divisor_Greatest_Common_Divisor)"