We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent cfe0d16 commit 56a97a9Copy full SHA for 56a97a9
maths/gcd_iterative.py
@@ -1,4 +1,4 @@
1
-def gcd_iterative(a: int, b: int) -> int:
+def gcd_iterative(first_number: int, second_number: int) -> int:
2
"""
3
Compute the greatest common divisor (GCD) of two numbers iteratively.
4
@@ -8,6 +8,6 @@ def gcd_iterative(a: int, b: int) -> int:
8
>>> gcd_iterative(7, 5)
9
10
11
- while b != 0:
12
- a, b = b, a % b
13
- return a
+ while second_number != 0:
+ first_number, second_number = second_number, first_number % second_number
+ return first_number
0 commit comments