euclidean: Euclidean function, finds the greatest common divisor of two...
In martynas2514/Lab03: Euclidean and Dijkstra algorithms
Description
Usage
Arguments
Value
Examples
Description
Euclidean function, finds the greatest common divisor of two numbers. Find Wikipedia docs Here.
Usage
1
euclidean(value1, value2)
Arguments
value1
An integer number must be introduced
value2
An integer number must be introduced
Value
It will return the greatest common divisor between value 1 and value 2. An integer will be returned.
Examples
1
2
martynas2514/Lab03 documentation built on Sept. 12, 2020, 11:37 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 Examples
Description
Euclidean function, finds the greatest common divisor of two numbers. Find Wikipedia docs Here.
Usage
1 | euclidean(value1, value2)
|
Arguments
value1 |
An integer number must be introduced |
value2 |
An integer number must be introduced |
Value
It will return the greatest common divisor between value 1 and value 2. An integer will be returned.
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.