I need some help with some c++ homework. This is the assignment:

Implement the Euclidean Algorithm, name the function gcd(), to find the greatest common divisor of two positive integers. Write a driver program to test gcd() function

Thank you for any help in advance!

The Euclidean Algorithm procedure gcd(a, b: positive integers) x:a y:= b while y#0 r:= x mod y x:= y y:= r return x (gcd(a,b) is x