src/HumNum.cpp
int HumNum::gcdIterative(int a, int b) {
	int c;
	while (b) {
		c = a;
		a = b;
		b = c % b;
	}
	return a < 0 ? -a : a;
}
//////////////////////////////
//
// HumNum::gcdIterative -- Returns the greatest common divisor of two
//      numbers using an iterative algorithm.
//
:gcdIterative -- Returns the greatest common divisor of two
numbers using an iterative algorithm.
: gcdIterative -- Returns the greatest common divisor of two numbers using an iterative algorithm .
int HumNum::gcdIterative(int a, int b) {
	int c;
	while (b) {
		c = a;
		a = b;
		b = c % b;
	}
	return a < 0 ? -a : a;
}
int HumNum :: gcdIterative ( int a , int b ) { int c ; while ( b ) { c = a ; a = b ; b = c % b ; } return a < 0 ? - a : a ; }
HumNum::gcdIterative -- Returns the greatest common divisor of two
numbers using an iterative algorithm.
HumNum :: gcdIterative -- Returns the greatest common divisor of two numbers using an iterative algorithm .