euclidean: Euclidean algorithm to find greatest common divisor.
In venkatavarun-123/R_LAB3: R_LAB3(One Line, Title Case)
Description
Usage
Arguments
Value
Source
Description
The algorithm replaces larger of the two numbers by the remainder when divided by smaller of two numbers and stops when remainder equals zero.
Usage
1
euclidean(x, y)
Arguments
x
a numeric scalar.
y
another numeric scalar.
Value
The greatest common divisor of two numbers passed in as arguments.
Source
https://en.wikipedia.org/wiki/Euclidean_algorithm.
venkatavarun-123/R_LAB3 documentation built on Dec. 23, 2021, 3:02 p.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
Description
The algorithm replaces larger of the two numbers by the remainder when divided by smaller of two numbers and stops when remainder equals zero.
Usage
1 | euclidean(x, y)
|
Arguments
x |
a numeric scalar. |
y |
another numeric scalar. |
Value
The greatest common divisor of two numbers passed in as arguments.
Source
https://en.wikipedia.org/wiki/Euclidean_algorithm.
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.