calculate gcd (very simple)
$30-5000 USD
Paid on delivery
This program would ask the user to input two integers and it would output the gcd (greatest common divisor) of these integers using Euclidean Algorithm. The pseudocode for Euclidean Algorithm is as follows procedure gcd(a,b:positive integers) x:=a y:=b while y is not equal to 0 begin r:= x mod y x:= y y:= r end {gcd (a,b) is x} Below is an example of how the Euclidian algorithm works for two positive integers 414, 662 662= 414*1 +248 414= 248*1 +166 248= 166*1+82 166= 82*2 +2 82= 2*41 +0 so the gcd of (414,662) since 2 is the last nonzero remainder.
## Deliverables
The program should be able to detect invalid input and should display an error message if the input is not valid.
## Platform
The program must compile on a g++ compiler. THE DEADLINE FOR THIS IS THURSDAY FEBRUARY 26TH 04.
Project ID: #3108512
About the project
Awarded to:
38 freelancers are bidding on average $8 for this job
