// Lawrence Bush

// Lab Session:  1
// RCS account:  bushl

//	gcd.h -		This header file contains a function which 
//			computes the greatest common divisor of two 
//			inputs.

#ifndef GCD_H
#define GCD_H
#include<iostream>
int gcd( const long int & A,  const long int & B) {
//	std::cout<<"gcd\n";
if (B != 0) // if B=0, this is the base case, the gcd is whatever A is.
{
	
//	std::cout<<"( "<<B<<","<<A%B<<" )\n";

return gcd(B,A%B);// Recursively call gcd,  and replace A with B and B with A mod B.  This also recursively returns whatever A is in the base case.
}
return A; // return A in the base case when B=0 
}


#endif