Find gcd of two numbers

Question

Accepted Answer

The greatest common divisor (gcd) of two numbers is the largest positive integer that divides both numbers without leaving a remainder.

The gcd can be found using the Euclidean algorithm.
Start by dividing the larger number by the smaller number.
If the remainder is 0, the smaller number is the gcd.
If the remainder is not 0, replace the larger number with the smaller number and the smaller number with the remainder.
Repeat the process until the remainder is 0.

Accepted Answer

// C program to calculate GCD of two numbers 
 #include
 // The code used a recursive function to return gcd of p and q 
  int gcd(int p, int q) 
  { 
 
  // checking divisibility by 0 
  if (p == 0) 
  return q;
  
  if (q == 0) 
  return p; 
 
  // base case 
  if (p == q) 
  return p; 
  
  // p is greater 
  if (p > q) 
  return gcd(p-q, q); 
 
  else
  return gcd(p, q-p); 
  } 
 
 // Driver program to test above function 
 int main() 
 {
  int p = 98, q = 56; 
  printf("GCD of %d and %d is %d ", p, q, gcd(p, q)); 
  return 0; 
 }

Find gcd of two numbers

Top Wipro Project Engineer interview questions & answers

Popular interview questions of Project Engineer

Top HR questions asked in Wipro Project Engineer