euclidean: euclidean

Description Usage Arguments Value References

Description

euclidean The Euclidian algorithm can find the greatest common divisor of two numbers.

Usage

1
euclidean(a, b)

Arguments

a

Integer number

b

Interger number

Value

An interger represents the greatest common divisor of two numbers.

References

https://en.wikipedia.org/wiki/Euclidean_algorithm


fengye0907/LAB3 documentation built on May 9, 2019, 5:01 a.m.