euclidean: Find 'Greatest Common Divisor'(GCD) for two given numbers
In shaiq681/alkhwarizm: An implementation of Euclidean and Dijkhstra Algorithm
Description
Usage
Arguments
Value
References
Examples
Description
Find 'Greatest Common Divisor'(GCD) for two given numbers
Usage
1
euclidean(a, b)
Arguments
a
A positive integer.
b
A positive integer.
Value
The GCD of a and b.
References
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
shaiq681/alkhwarizm documentation built on Sept. 22, 2020, 10:33 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
Find 'Greatest Common Divisor'(GCD) for two given numbers
Usage
1 | euclidean(a, b)
|
Arguments
a |
A positive integer. |
b |
A positive integer. |
Value
The GCD of 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.