gcd_recursive: Calculates the Greatest Common Divisor of two integers using...

Description Usage Arguments Value References Examples

Description

The recursive implementation of the greatest common divisor algorithm was described in the Elements of Euclid but may even predate that.

Usage

1

Arguments

a

First integer

b

Second integer

Value

The greatest common divisor

References

Cormen, T., Leiserson, C., Rivest, R., & Stein, C. (2009). Introduction to algorithms (3rd ed., pp. 928-930, 934-935). Cambridge (Inglaterra): Mit Press. Euclidean algorithm. (2017, May 18). In Wikipedia, The Free Encyclopedia. From https://en.wikipedia.org/w/index.php?title=Euclidean_algorithm&oldid=780973502

Examples

1

aschleg/numberr documentation built on May 14, 2019, 10:31 a.m.