euclidean: Euclidean Algorithm
In henkar91/AdvRprogr_lab3: Euclidean and Dijkstra's algorithms
Description
Usage
Arguments
Value
References
Description
Euclid's algorithm is an efficient method for computing the greatest common divisor of two numbers. The largest number that divides both of them without leaving a remainder.
Usage
1
euclidean(a, b)
Arguments
a
A number.
b
A number.
Value
A number, which is the greatest common divisor.
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
henkar91/AdvRprogr_lab3 documentation built on May 17, 2019, 12: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 References
Description
Euclid's algorithm is an efficient method for computing the greatest common divisor of two numbers. The largest number that divides both of them without leaving a remainder.
Usage
1 | euclidean(a, b)
|
Arguments
a |
A number. |
b |
A number. |
Value
A number, which is the greatest common divisor.
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.