euclidean: Euclidean
In senseiyukisan/732A94: Calculate distances based on different algorithms
Description
Usage
Arguments
Value
References
Description
Implementation of the substraction based euclidean algorithm to find the Greatest Common Divisior (GCD) of two Integer numbers.
Usage
1
euclidean(a, b)
Arguments
a
An Integer.
b
A Integer
Value
The GCD of input params.
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
senseiyukisan/732A94 documentation built on Sept. 18, 2020, 12:56 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
Implementation of the substraction based euclidean algorithm to find the Greatest Common Divisior (GCD) of two Integer numbers.
Usage
1 | euclidean(a, b)
|
Arguments
a |
An Integer. |
b |
A Integer |
Value
The GCD of input params.
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.