You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/algebra/euclid-algorithm.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -84,7 +84,7 @@ int lcm (int a, int b) {
84
84
85
85
## Binary GCD
86
86
87
-
The Binary GCD algorithm is an optimization to the normal Eulidean algorithm.
87
+
The Binary GCD algorithm is an optimization to the normal Euclidean algorithm.
88
88
89
89
The slow part of the normal algorithm are the modulo operations. Modulo operations, although we see them as $O(1)$, are a lot slower than simpler operations like addition, subtraction or bitwise operations.
0 commit comments