euclidean: Calculate Greatest Common Divisor
In RajaHussnain/Lab3Package: Implementation of Euclidean and Dijkstra
Description
Usage
Arguments
Value
Source
Examples
View source: R/euclideanfunction.R
Description
Calculate Greatest Common Divisor
Usage
1
euclidean(a, b)
Arguments
a
Interger 1
b
Interger 2
Value
Return Greatest Common Divisor
Source
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
RajaHussnain/Lab3Package documentation built on Dec. 18, 2021, 9:51 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 Source Examples
View source: R/euclideanfunction.R
Description
Calculate Greatest Common Divisor
Usage
1 | euclidean(a, b)
|
Arguments
a |
Interger 1 |
b |
Interger 2 |
Value
Return Greatest Common Divisor
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.