Fast Greatest Common Divisor (GCD) Algorithm

public int GCD(int value1, int value2)
{

    int max = 0;
    bool gcdFound = false;
    int counter = 1;

    //Make sure both numbers are atleast 2 or above
    if (( value1 <= 1 ) || (value2 <= 1))
        return (value1 < value2 ? value1 : value2);

    //If one of the two numbers is the exact divisor of then other or are equal to each other then we return that number here.
    gcdFound = (((value1 % value2 ) == 0 ) || ((value2 % value1 ) == 0 ));
    if (gcdFound)
    {
        return (value1 > value2 ? value2 : value1);
    }

    //Find the larger of the two numbers, the GCD can not be more than half of the smaller number.
    max =  value1 > value2 ? (value2 / 2) : (value1 / 2);
    counter = max + 1;

    while ((!gcdFound) && (counter > 1))
    {
        counter--;
        gcdFound = ((value1 % counter) == 0) && ((value2 % counter) == 0);
    }

    return counter;
}