C#. Algorithms. Greatest common divisor

Posted on 20.09.2017 by Stanislav_Panteleev

    public static int gcd(int p, int q)
        {
            if (q == 0) return p;
            int r = p % q;
            return gcd(q, r);
        }

public static int gcd(int p, int q)

{

if (q == 0) return p;

int r = p % q;

return gcd(q, r);

}

This entry was posted in C#. Bookmark the permalink.

C#. Algorithms. Greatest common divisor

MY PROJECTS

Recent Posts

Categories