Answer / pavan_mustyala

int gcdRecurse(int a, int b)
{
int temp;

// error handling to prevent divide by zero
if(!b)
{
return b;
}

temp = a % b;

if (temp == 0)
{
return(b);
}
else
{
return(gcdRecurse(b, temp));
}
}

Answer / rakib hyder

#include<stdio.h>
int gcd(int a,int b)
{
if(a==0)
return b;
else if(b==0)
return a;
else if(a>b)
return gcd(b,a%b);
else
return gcd(a,b%a);
}

Answer / arun ananda jadhav

int gcd(int num1,int num2)
{
if(nu1%num2)
{
return(gcd(num2,num1%num2));
}
else
{
return(1);
}
}

Answer / deepak

#include<stdio.h>
int main(){
int n1,n2,gcd;
printf("\nEnter two numbers: ");
scanf("%d %d",&n1,&n2);
gcd=findgcd(n1,n2);
printf("\nGCD of %d and %d is: %d",n1,n2,gcd);
return 0;
}

Answer / abilash k alex

what is gcd?

Develop a routine to reflect an object about an arbitrarily selected plane

0 Answers  

What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?

1 Answers  

What is "far" and "near" pointers in "c"...?

3 Answers  

#include <stdio.h> main() { char * str = "hello"; char * ptr = str; char least = 127; while (*ptr++) least = (*ptr<least ) ?*ptr :least; printf("%d",least); }

1 Answers  

#if something == 0 int some=0; #endif main() { int thing = 0; printf("%d %d\n", some ,thing); }

1 Answers  

main() { unsigned int i=10; while(i-->=0) printf("%u ",i); }

2 Answers   HP,

How will u find whether a linked list has a loop or not?

8 Answers   Microsoft,

Which version do you prefer of the following two, 1) printf(“%s”,str); // or the more curt one 2) printf(str);

1 Answers  

C program to print magic square of order n where n > 3 and n is odd

2 Answers   Accenture,

#include<stdio.h> main() { FILE *ptr; char i; ptr=fopen("zzz.c","r"); while((i=fgetch(ptr))!=EOF) printf("%c",i); }

1 Answers  

main() { char not; not=!2; printf("%d",not); }

1 Answers  

main() { printf("\nab"); printf("\bsi"); printf("\rha"); }

3 Answers