Greatest Common Divisor GCD using euclidean algorithm Java Program
This program will calculate the greatest common divisor of two positive integers using euclidean algorithm. in its simplest form, Euclid’s algorithm starts with at pair of positive integers and forms a new pair that consists of the smaller number and the difference between the larger and smaller umbers. the process repeats until the numbers are equal. That number then is the greatest common divisor of the original pair. for example,to calculate the GCD of 49 and 35 the GCD of 49 and 35 is 7. Program input and output should use JOption. the validity of the inputs shall be checked and user error messages are displayed.