euclidean: Implement the Euclidian algorithm
In shihs/LiUAdRLab3: Implement Euclidian algorithm and Dijkstras algorithm.
Description
Usage
Arguments
Value
Examples
Description
euclidian() can find the greatest common divisor of two numbers.
Usage
1
euclidean(num1, num2)
Arguments
num1
Integer number
num2
Interger number
Value
Interger number
Examples
1
2
3
4
number1 <- 91
number2 <- 26
gcd <- euclidean(number1, number2)
gcd
shihs/LiUAdRLab3 documentation built on May 6, 2019, 8:32 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 Examples
Description
euclidian() can find the greatest common divisor of two numbers.
Usage
1 | euclidean(num1, num2)
|
Arguments
num1 |
Integer number |
num2 |
Interger number |
Value
Interger number
Examples
1 2 3 4 | number1 <- 91
number2 <- 26
gcd <- euclidean(number1, number2)
gcd
|
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.