0
Finding GCD
How can I find greatest common divisor using recursion in java ?I tried a lot of times and could not think of any algorithm. Thanks in advance.
1 Respuesta
+ 3
Use Euclid algorithm
GCD(a, 0) =a
Try to make b shorter by dividing b by a using recursion