euclidean: Calculate Greatest Common Dvisor(GCD) for two input variables
In gyommy15/lab3git: Eculidean and Dijkstra algorithm
Description
Usage
Arguments
Value
References
Description
Calculate Greatest Common Dvisor(GCD) for two input variables
Usage
1
euclidean(x, y)
Arguments
x
A number(integer)
y
A number(integer)
Value
GCD(Greatest Common Divisor) of x and y
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
gyommy15/lab3git documentation built on May 3, 2019, 2:58 p.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
Calculate Greatest Common Dvisor(GCD) for two input variables
Usage
1 | euclidean(x, y)
|
Arguments
x |
A number(integer) |
y |
A number(integer) |
Value
GCD(Greatest Common Divisor) of x and y
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.