Loading

The greatest common divisor of integers x and y

ahmed sami

The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y.
Write a recursive method Gcd that returns the greatest common divisor of x and y.
The Gcd of x and y is defined recursively as follows:
If y is equal to 0, then Gcd( x, y) is x; otherwise, Gcd( x, y ) is Gcd( y, x % y ), where % is the modulus operator.

2 Replies

Know the answer? Post it — somebody with the same question will find it here.

Vulpes13y ago
Accepted answer
Try:

using System;

class Test
{
static void Main()
{
int x, y;
Console.Write("Enter x : ");
int.TryParse(Console.ReadLine(), out x);
Console.Write("Enter y : ");
int.TryParse(Console.ReadLine(), out y);
Console.WriteLine("The GCD is {0}", Gcd(x, y));
Console.ReadKey();
}

static int Gcd(int x, int y)
{
if(y == 0) return x;
return Gcd(y, x % y);
}
}
+1
Daril4y ago
Heres my little code:
Scanner S=new Scanner(System.in);
System.out.println("enter the first number");
int A=S.nextInt();
System.out.println("enter the second number");
int B=S.nextInt();
int gcd=1;
for(int i=1;i<=A && i<=B;i++)
{
if(A%i==0 && B%i==0)
{
gcd=i;
}
}
System.out.println("the gcd of " +A+ " and "+B+" is "+gcd);

0