一个n个数的排列可以由n-1个数的排列生成.只要先生成第n-1个数再插入第n个数就可以了.这是递归算法的中心思想.
#include <iostream.h>
void permu(char a[], int m, int n) { // 排列算法
int i;
char t;
if (m<n-1) {
permu(a, m+1, n); //递归
for (i=m+1;i<n;i++) {
t=a[m]; a[m]=a[i]; a[i]=t;
permu(a, m+1, n); //递归
t=a[m]; a[m]=a[i]; a[i]=t; }
} else {
cout<<a<<endl;//屏蔽掉输出
}
}
int main() {
char a[]="ABC";
permu(a, 0, 3);
return 0;
}
i am a student--> student a am i
#include<iostream>
#include<sstream>
#include<string>
using namespace std;
int main()
{
string str="i am a student",temp,result;
stringstream ss(str);
while(ss>>temp)
{
result=temp+" "+result;
cout << result <<endl;
}
cout<<result<<endl;
system("PAUSE");
return 0;
}
或者
#include <stdio.h>
void RevStr(char src[])
{
char *start=src, *end=src, *p=src,e;
int i=0;
do
{
if(*p==' '|| *p==','|| *p=='.'|| *p==';'|| *p=='!'||! *p)
{
i=1;
end=p-1;
while(start < end)e= *start, *start++= *end, *end--=e;
}
if(i)start=p+1,i=0;
}while(*p++);
while(*end++);end-=2;
while(src < end)e= *src, *src++= *end, *end--=e;
}
int main()
{
char src[]="i am a !student!!",pause;
printf("%s/n",src);
RevStr(src);
printf("%s/n",src);
scanf("%c",&pause);
return 0;
}