Skip to content

Commit 1fd75e6

Browse files
authored
fix typo
1 parent dbe7d35 commit 1fd75e6

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/algebra/euclid-algorithm.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -84,7 +84,7 @@ int lcm (int a, int b) {
8484

8585
## Binary GCD
8686

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.
8888

8989
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.
9090
So it would be better to avoid those.

0 commit comments

Comments
 (0)