mn_recur.cpp

来自「数据结构常用算法合集」· C++ 代码 · 共 23 行

 //mm_recur.cpp
 #include <iostream.h>
 #include <conio.h>
 int sum_mn(int,int);
 void main()
 { int m,n;
   cout << "m,n="; cin >> m >>n;
   if (m>n)
   { int t=m;
     m = n;
     n = t;
   }
   cout << m <<"到" << n <<"间和= "<< sum_mn(m,n);
   getch();
 }
 
 int sum_mn(int m,int n)
 { int s;
   if (n>m)  s = n + sum_mn(m,n-1);	//自己调用自己但参数值减1
   else s=m;
   return s;
 }