Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$ bits

(Store only the current values being iterated on)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM? words size O(1)

Year

-300

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Euclid%27s_algorithm_(Greatest_Common_Divisor_Greatest_Common_Divisor)&oldid=45581"