C # seek GCD

GCD a maximum integer that is divisible by two integers, for example, 24 and 152 GCD 3. Seeking GCD can be realized by remainder method. That is, the largest number in the two number is divided by the smallest number, and then the divisor is divided by the remainder, until the remainder is 0 o'clock, before the divisor is the GCD of two digits. The algorithm for calculating GCD is as follows:

public float Maxgongyueshu (int n1,int n2)
{
    int temp = Math.max (n1, N2);
    N2 = Math.min (n1, N2); the smallest of the two numbers in the//N2
    N1 = Temp;//n1 in the largest of two digits
    while (n2!=0)
    {
        N1 = n1 > n2? n1:n2;//make the number in N1 greater than the number in N2
        int m=n1% N2;
        N1 = n2;
        N2 = m;
    }
    return N1;
}