Algorithmintro
Euclidean algorithm
Also called Euclid's algorithm, subtractive Euclidean algorithm, division-based gcd.
Repeatedly replace (a, b) by (b, a mod b) until the remainder is zero; runs in O(log min(a, b)) steps.
Repeatedly replace (a, b) by (b, a mod b) until the remainder is zero; runs in O(log min(a, b)) steps.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 4XB0RJ Edit this page History Report an error