The greatest common divisor (gcd) of two positive integers is the largest integer that divides evenly into both of them. For example, the greatest common divisor of 102 and 68 is 34 since both 102 and 68 are multiples of 34, but no integer larger than 34 divides evenly into 102 and 68.
We can efficiently compute the gcd using the following property, which holds for positive integers p and q:
If p > q, the gcd of p and q is the same as the gcd of q and p % q.
Write a recursive gcd function (and a main function to test it) that uses this algorithm.
Hello. It is pretty easy thing it can be done in one or two hours, maybe even sooner that one hour..
10 freelancers are bidding on average $17 for this job
hi... i can do this. Please let me know to start immediately. i can deliver you on time. Please initiate communication to discuss further. thanks
Hello, i am an expert software developer. This is an easy program for me, I an do this in less then an hour. Award me this project and i will be happy to work for you. I am free and i can start you project immediate Daha Fazla
Hey there, I already have the code with me. You just need to award me the project and I can hand it over to you. In fact you can already have it right here. Please ask me if you need full implementation or any modifica Daha Fazla
Hi, This is really easy one. I make it in half an hour. Hoping for the positive reply. Regards chandra
I have already written and tested this function. It works. What else do you need? Sorry, but I can't ask for lower price — my price is a lowest possible.