可以参考 本博客 排序总结<quick_sort>: http://blog.csdn.net/zlb_xidian/archive/2010/07/23/5756921.aspx
int cc(int i)
{
cout<<"Called >>>>>>>> flag:"<<i<<endl;
int temp = i;
for(; i<4;)
{
printf("[%d]with i=%d/n",cc(++i),i);
}
cout<<"Ended ------ flag:"<<temp<<endl;
return i;
}
int main()
{
cc(1);
return 1;
}
int getN(int n)
{
call++;//call是一个全局变量
cout<<"called "<<call<<" with flag(n):"<<n<<endl;
if(n==1)
{
// cout<<"ended "<<call<<endl;
return 1;
}
int temp = n*getN(n-1);
cout<<"ended "<<call<<" with flag(n):"<<n<<endl;
return temp;
}
int main()
{
cout<<"getN"<<getN(6)<<endl;
return 1;
}