View source for Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor)

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

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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 ==

Return to Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor).

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Euclid%27s_algorithm_(Greatest_Common_Divisor_Greatest_Common_Divisor)"

Navigation menu