//面向对象上机题 二
//迭归算法
//Date:2005/10/27
//Make By:张建波
#include "iostream.h"
#include "string.h"
void fs(char *s,int n=0)
{
int L=strlen(s);
if(n!=L)
{ n++;
cout<<s[L-n];
fs(s,n);
}
}
void main()
{
char *s="abcdefgh";
cout<<"/n原字符串为:"<<s<<endl;
cout<<"逆序输出的字符串为:";
fs(s);
cout<<endl;
}