GCD help

[epicjomi]

can someone tell me what is the code for finding the GCF of two integers or Euclid's Algorithm, can you please make it as simple as possible. Thanks

[vlad from moscow]

int GCD( int a, int b )
{
	a = std::abs( a );
	b = std::abs( b );

	while ( b )
	{
		int tmp = a % b;
		a = b;
		b = tmp;
	}

	return ( a );
}

[epicjomi]

great, thanks !