euclid

int GCD_finder ( int a, int b )
{
    if( b == 0 )
        return( a );
    else
    {
        int q, r;
        divMod(a, b, &q, &r); // (q,r) = divMod a b
        return ( GCD_finder(b, r) );
    }
}