Platinum Partner

GCD Of Two Numbers.

// finds GCD of a and b using Euclidian algorithm


public int GCD(int a, int b)
{
   if (b==0) return a;
   return GCD(b,a%b);
}
{{ tag }}, {{tag}},

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}
{{ parent.authors[0].realName || parent.author}}

{{ parent.authors[0].tagline || parent.tagline }}

{{ parent.views }} ViewsClicks
Tweet

{{parent.nComments}}