Java-Programs/gcd.java at master · priyamm/Java-Programs · GitHub

40 lines (30 loc) · 751 Bytes

public class gcdAndLcm

{

// Recursive function to return gcd of a and b

static int gcd(int a, int b)

{

if (a == 0)

return b;

if (b == 0)

return a;

// base case

if (a == b)

return a;

// a is greater

if (a > b)

return gcd(a-b, b);

return gcd(a, b-a);

}

static int lcm(int a, int b)

{

return ((a*b)/gcd(a, b));

}

// Driver method

public static void main(String[] args)

{

System.out.println(gcd(40,5));

System.out.println(gcd(48,56));

System.out.println(lcm(40,5));

System.out.println(lcm(48,56));

}

Expand file tree