euclidean: euclidean
In Dap246/Lab03: Euclidean and Dijkstras Algorithms
Description
Usage
Arguments
Value
References
Examples
Description
euclidean use the euclidean algorithm to calculate the Greatest Common Divisor (GCD) of 2 numbers.
Usage
1
euclidean(b, a)
Arguments
b
a number
a
a number
Value
The GCD of b and a.
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
Dap246/Lab03 documentation built on Dec. 17, 2021, 4:05 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 Examples
Description
euclidean use the euclidean algorithm to calculate the Greatest Common Divisor (GCD) of 2 numbers.
Usage
1 | euclidean(b, a)
|
Arguments
b |
a number |
a |
a number |
Value
The GCD of b and a.
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
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.