euclidean: euclidean function
In nahfa911/rlab03: Greatest common divisor of two numbers and the shortest path in a graph
Description
Usage
Arguments
Value
Examples
Description
This function implements the Euclidian algorithm to find the greatest common
divisor of two numbers. The description of the algorithm with pseudocode can
be found here: https://en.wikipedia.org/wiki/Euclidean_algorithm
Usage
1
euclidean(a, b)
Arguments
a
An integer.
b
An integer.
Value
This function return a number that shows the greatest common divisor
of a and b.
Examples
1
2
nahfa911/rlab03 documentation built on May 9, 2019, 5:55 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
This function implements the Euclidian algorithm to find the greatest common divisor of two numbers. The description of the algorithm with pseudocode can be found here: https://en.wikipedia.org/wiki/Euclidean_algorithm
Usage
1 | euclidean(a, b)
|
Arguments
a |
An integer. |
b |
An integer. |
Value
This function return a number that shows the greatest common divisor
of a and b.
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.