递归, 栈原理发挥的淋漓尽致:堪称经典!
#include<stdio.h>
void reverse(char *p)
{
if( *p == '/0' )
return;
reverse( p+1 );
printf( "%c", *p );
}
int main()
{
reverse("abcdefg");
printf("/n");
return 0;
}
递归, 栈原理发挥的淋漓尽致:堪称经典!
#include<stdio.h>
void reverse(char *p)
{
if( *p == '/0' )
return;
reverse( p+1 );
printf( "%c", *p );
}
int main()
{
reverse("abcdefg");
printf("/n");
return 0;
}
id="I7" marginwidth="0" marginheight="0" src="http://www.bookeba.cn/securi