#include <iostream>
using namespace std;
int gcd( int m, int n )
{
if( m<n )
{
int temp = m;
m = n;
n = temp;
}
if( m%n == 0 ) //基准情形
{
return n;
}
else //不断推进
{
return gcd( n,m%n );
}
}
int main()
{
int a = 15;
int b = 10;
cout<<a<<"和"<<b<<"最大公约数为:";
cout<<gcd(a,b)<<endl;
return 0;
}
递归的两个基本法则:1.基准情形 2.不断推进