Nerys Jimenez
The College of Saint Rose
Cyber-security, Spring 2017
Gcd.java implements the Extended Euclidean algorithm.
Besides finding the greatest common divisor of integers a and b,
it also finds integers x and y that satisfy ax + by = gcd(a, b)