CareerCup

int GCD(int a, int b)
{
if(a == 0)
return b;
while (b != 0)
{
if(a > b)
a = a - b;
else
b = b - a;
}
return a;
}

int gcd(int a, int b)
	{
			  if(b==a) return a;
			  if (a>b)
				  return gcd(a-b, b);
			  else
				  return gcd(a, b-a);
	}

what is M and N....?

I guess M=U, N=V.. though it looks a little strange...

Euclid algo. Whether this was asked during an interview? I don't believe ...

what is euclid algo

public int getGCD(int u, int v){

int x ,y;

if(u < v){
x=u; y= v;
}
else{
x=v; y=u;
}
while(x!=0){

u= x;
x=y%x;
y=u;
}

return u;
}

int gcd(int a, int b)
{
  if(b==0) return a;
  return gcd(b, a%b);
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string.h>
#include<math.h>
using namespace std;
int main(void)
{
int a,b,c,d,temp=0,rem=0;
cout<<"Enter the two nos\n";
cin>>a>>b;
c=a<b?a:b;
d=a>b?a:b;
while(rem!=0){
rem=d%c;
d=c;
c=rem;
}
cout<<c;
cin.get();
}

euclid's algo is the right ans dude...

this can be done using binary GCD algorithm (steins alg)

void main()
{
int num1, num2;
int div, rem,quot;
printf("\n Enter number 1 : \n");
scanf("%d",&num1);
printf("\n Enter number 2 : \n");
scanf("%d",&num2);

if(num1<num2)
{
quot=num1;
div=num2;
}
else
{
quot=num2;
div=num1;
}
rem=num1+num2;

while(rem)
{
rem=div%quot;
if(rem!=0)
{
div=quot;
quot=rem;
}
}
printf("\n GCF is <%d> \n",quot);
}