Pages

July 19, 2013

Greater Common Divisor (GCD) between 2 numbers

This time we're considering an easy math problem: the Greater Common Divisor between two integers.


/** Compute the Greater Common Divisor (GCD) for two numbers.

 @param num1 First number.
 @param num2 Second number.
 @return Returns the Greater Common Divisor (GCD).

 */
+ (NSInteger)greaterCommonDivisorForNumber1:(NSInteger)num1 andNumber2:(NSInteger)num2 {
    if (num1 < 0 || num2 < 0) {
        LogError(@"Numbers are negative. Cannot compute GCD");
    } else {
        NSInteger temp = num1 % num2;
        while (temp > 0) {
            num1 = num2;
            num2 = temp;
            temp = num1 % num2;
        }
    }
    return num2;
}



Download the ready-for-use source file (.m) of Greater Common Divisor (GCD) between 2 numbers

No comments:

Post a Comment