Euclidean: Euclidean Function
In zahrajalilpour292/first_package: It calculates the greatest common divisor of two numbers
Description
Usage
Arguments
Value
References
Examples
Description
This algorithm efficiently computes the greatest common divisor.
Usage
1
euclidean(a, b)
Arguments
a
is an integer
b
is an integer
Value
It returns the greatest common divisor of two integers a and b
References
"https://en.wikipedia.org/wiki/Euclidean_algorithm"
Examples
1
2
zahrajalilpour292/first_package documentation built on Oct. 4, 2020, 2:24 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
This algorithm efficiently computes the greatest common divisor.
Usage
1 | euclidean(a, b)
|
Arguments
a |
is an integer |
b |
is an integer |
Value
It returns the greatest common divisor of two integers a and b
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.