euclidean: Greatest common divisor
In marma330/RPG: Euclidean and Dijkstra Algorithms
Description
Usage
Arguments
Value
References
Description
Greatest common divisor
Usage
1
euclidean(num1, num2)
Arguments
num1
is a number
num2
is a number
Value
the Greatest common divisor between two numbers
References
https://en.wikipedia.org/wiki/Euclidean algorithm
marma330/RPG documentation built on May 9, 2019, 5:52 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value References
Description
Greatest common divisor
Usage
1 | euclidean(num1, num2)
|
Arguments
num1 |
is a number |
num2 |
is a number |
Value
the Greatest common divisor between two numbers
References
https://en.wikipedia.org/wiki/Euclidean algorithm
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.