euclidean: The Euclidean algorithm: Greatest common divisor of two...
In TheodorEmanuelsson/dijkstrasAlgorithm: Computes Euclidean and Dijkstra's algorithms in R
Description
Usage
Arguments
Value
Source
Examples
Description
The Euclidean algorithm: Greatest common divisor of two scalars
Usage
1
euclidean(a, b)
Arguments
a
A natural number.
b
A natural number.
Value
Returns the greatest common divisor of a and b
Source
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
TheodorEmanuelsson/dijkstrasAlgorithm documentation built on Dec. 18, 2021, 4:11 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 Source Examples
Description
The Euclidean algorithm: Greatest common divisor of two scalars
Usage
1 | euclidean(a, b)
|
Arguments
a |
A natural number. |
b |
A natural number. |
Value
Returns the greatest common divisor of a and b
Source
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.