Description Usage Arguments Value References Examples
The recursive implementation of the greatest common divisor algorithm was described in the Elements of Euclid but may even predate that.
1 | gcd_recursive(a, b)
|
a |
First integer |
b |
Second integer |
The greatest common divisor
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
1 | gcd_recursive(21, 6)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.