This function returns the greatest common divisor of two integers

1 | ```
gcd(x, y)
``` |

`x` |
a nonnegative integer |

`y` |
a nonnegative integer |

The function utilizes the Euclidean algorithm to compute the greatest common divisor of two integers

An integer, which is the greatest common divisor. If both arguments are zero, then the returned value is 1.

Yuanhui Xiao

1 2 3 4 | ```
x <- 4
y <- 6
d <- gcd(x, y)
d
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.