euclidean: Function to calculate greatest common divisor of two numbers...
In drowsygoat/lab3.package: Estimates Euclidean distance & implements Djikstra's algorithm
Description
Usage
Arguments
Source
Description
Function to calculate greatest common divisor of two numbers (x and y) using the Euclidean algorithm based on pseudocode from Wikipedia.
Usage
1
euclidean(x, y)
Arguments
x
a numeric scalars or integers.
y
a numeric scalars or integers.
Source
https://en.wikipedia.org/wiki/Euclidean_distance
drowsygoat/lab3.package documentation built on Dec. 20, 2021, 1:19 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 Source
Description
Function to calculate greatest common divisor of two numbers (x and y) using the Euclidean algorithm based on pseudocode from Wikipedia.
Usage
1 | euclidean(x, y)
|
Arguments
x |
a numeric scalars or integers. |
y |
a numeric scalars or integers. |
Source
https://en.wikipedia.org/wiki/Euclidean_distance
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.