Update gcd.md
This commit is contained in:
@ -2,7 +2,7 @@
|
||||
|
||||
Calculates the greatest common divisor between two or more numbers/arrays.
|
||||
|
||||
The inner `_gcd `function uses recursion.
|
||||
The inner `_gcd` function uses recursion.
|
||||
Base case is when `y` equals `0`. In this case, return `x`.
|
||||
Otherwise, return the GCD of `y` and the remainder of the division `x/y`.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user