jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Make gcd iterative instead of recursive

Browse source
This commit is contained in:
def 2015-01-27 19:55:08 +01:00
commit 43bc72f1fe
1 changed files with 5 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

9
lib/pure/math.nim
View file

@ -344,10 +344,11 @@ proc `^`*[T](x, y: T): T =
proc gcd*[T](x, y: T): T = proc gcd*[T](x, y: T): T =
## Computes the greatest common divisor of ``x`` and ``y``. ## Computes the greatest common divisor of ``x`` and ``y``.
if y != 0: var (x,y) = (x,y)
gcd(y, x mod y) while y != 0:
else: x = x mod y
x.abs swap x, y
abs x
proc lcm*[T](x, y: T): T = proc lcm*[T](x, y: T): T =
## Computes the least common multiple of ``x`` and ``y``. ## Computes the least common multiple of ``x`` and ``y``.