Assignment # 3 : Solutions

In pseudo-code, the definition of the GCD, is: if b == 0 then GCD( a , b ) = a. otherwise GCD(a,b) = GCD( b , a%b ) Recall that the modulus operator, %, gives the remainder in integer division. For example, 20 % 16 is 4. [16 pts] Complete the recursive Java method below to implement the calculation of the greatest common divisor. ................
................