euclidean: Get GCD of two numbers
In shashiniyer/Euclid_Dijkstras: Implements Euclid's and Djikstra's Algorithms
Description
Usage
Arguments
Value
References
Examples
Description
Implements Euclid's algorithm to compute the greatest common divisor of two numbers
Usage
1
euclidean(x, y)
Arguments
x
A number
y
A number
Value
Greatest common divisor of x and y.
References
Examples
1
2
shashiniyer/Euclid_Dijkstras documentation built on Dec. 23, 2021, 1:21 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 Examples
Description
Implements Euclid's algorithm to compute the greatest common divisor of two numbers
Usage
1 | euclidean(x, y)
|
Arguments
x |
A number |
y |
A number |
Value
Greatest common divisor of x and y.
References
Examples
1 2 |
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.