Test by Bikram | Mock GATE | Test 3 | Question: 26

Question

The following function finds the $GCD$ recursively.
 

int GCD(int k, int u)
{
if( u = = 0 )
return k ;
else
return GCD( u , ____);
}

Fill in the blank with the most appropriate function:

• A. $k/u$     
• B. $u/k$    
• C. $u \% k$
• D. $k \% u$

Comments

@Arjun sir, someone changed the options.

---

@Arjun sir please change the options.

---

@Utkarsh Joshi

WHy isn't D)  k%u is right ??

---

D is correct! @jatin khachane 1

Answer 1

To calculate GCD of two numbers , we write the following code :

#include <stdio.h>
int hcf(int n1, int n2);
int main()
{
   int n1, n2;
   printf("Enter two positive integers: ");
   scanf("%d %d", &n1, &n2);

   printf("G.C.D of %d and %d is %d.", n1, n2, hcf(n1,n2));
   return 0;
}

int hcf(int n1, int n2)
{
    if (n2 != 0)
       return hcf(n2, n1%n2);
    else 
       return n1;
}

so it is k%u in our question, which is option D .