LinkedList/NList Files/Fraction.cpp
// find greatest common divisor using euclidean algorithm
find greatest common divisor using euclidean algorithm
find greatest common divisor using euclidean algorithm
int Fraction::gcd(const int& m, const int& n) {
	if (m % n == 0) {
		return n;
	}
	else {
		return gcd(n, m % n);
	}
}
int Fraction :: gcd ( const int & m , const int & n ) { if ( m % n == 0 ) { return n ; } else { return gcd ( n , m % n ) ; } }
find greatest common divisor using euclidean algorithm
find greatest common divisor using euclidean algorithm