euclidean: Euclidean Algorithm
In faridmusayev/R_Lab03: Euclidean and Dijkstra Algorithms

euclidean returns the greatest common divisor of two input (a,b) values.

1	euclidean(a, b)

`a`	Must be numeric scalar or integer
`b`	Must be numeric scalar or integer

The greatest common divisor of a and b

euclidean(100,10)

## Not run: 
euclidean('dog','cat')

## End(Not run)

faridmusayev/R_Lab03 documentation built on Dec. 20, 2021, 7:44 a.m.

faridmusayev/R_Lab03 index

README.md

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description