RSS

Re: help with Greatest common divisor

Please support our C++ advertiser: Programming Forums

help with Greatest common divisor

•

Join Date: Jun 2005

Posts: 33

Reputation: shre86 is an unknown quantity at this point

Rep Power: 4

Solved Threads: 1

shre86

Offline

Light Poster

Re: help with Greatest common divisor

Jul 1st, 2005

i ll give u a fn or the gcd of 2 nos..

Help with Code Tags

(Toggle Plain Text)

int gcd(int x,int y)
{
   if ( y>x )
      swap(x,y);
   while ( y!=0 )
   {
      temp=y;
      y=x-y;
      x=temp;
      if ( y>x )
         swap(x,y);
   }
   return x;
}

<< moderator edit: added [code][/code] tags and formatting; added missing semicolon >>

just call this fn for the first 2 nos.. then the gcd and the 3rd no. and then there gcd and the 4th no. and so on..
till all the nos are over.. u ll get ur final answer...

DaniWeb Home > Forums > Software Development > C++ > help with Greatest...

Re: help with Greatest common divisor

help with Greatest common divisor

Re: help with Greatest common divisor