What is pseudo code for GCD of two numbers?

Answer 1

public class GCD {

public static void main(String[] args) {

//Example how to use this method

System.out.println(GCD(15,50));

}

//find the greatest common divisor of two numbers

public static int GCD(int a, int b){

if (b == 0) return a;

return GCD(b, a % b);

}

}

Hope this help to solve you problem.

Answer 2

Something that is similar to an actual program. Example:

Define gcd (a, b) as

a if b==0

b if a==0

gcd (a, b modulo a) if a<=b

gcd (b, a modulo b) if a>b