a-l共12个字母，给出所有能排列的顺序并输出，任何语言都可以，10分钟解决，一个老程序员的话

[此贴子已经被作者于2006-1-8 11:20:52编辑过]

10分钟还不够我构思的

12*11*10*9*8*7*6*5*4*3*2*1
种组合

我的电脑会死机
<%for i1=1 to 12
for i2=1 to 12
if i2<>i1 then
for i3=1 to 12
if i3<>i1 and i3<>i2 then
for i4=1 to 12
if i4<>i3 and i4<>i2 and i4<>i1 then
for i5=1 to 12
if i5<>i4 and i5<>i3 and i5<>i2 and i5<>i1 then
for i6=1 to 12
if i6<>i5 and i6<>i4 and i6<>i3 and i6<>i2 and i6<>i1 then
for i7=1 to 12
if i7<>i6 and i7<>i5 and i7<>i4 and i7<>i3 and i7<>i2 and i7<>i1 then
for i8=1 to 12
if i8<>i7 and i8<>i6 and i8<>i5 and i8<>i4 and i8<>i3 and i8<>i2 and i8<>i1 then
for i9=1 to 12
if i9<>i8 and i9<>i7 and i9<>i6 and i9<>i5 and i9<>i4 and i9<>i3 and i9<>i2 and i9<>i1 then
for i10=1 to 12
if i10<>i9 and i10<>i8 and i10<>i7 and i10<>i6 and i10<>i5 and i10<>i4 and i10<>i3 and i10<>i2 and i10<>i1 then
for i11=1 to 12
if i11<>i10 and i11<>i9 and i11<>i8 and i11<>i7 and i11<>i6 and i11<>i5 and i11<>i4 and i11<>i3 and i11<>i2 and i11<>i1 then
for i12=1 to 12
if i12<>i11 and i12<>i10 and i12<>i9 and i12<>i8 and i12<>i7 and i12<>i6 and i12<>i5 and i12<>i4 and i12<>i3 and i12<>i2 and i12<>i1 then
response.Write(chr(96+i1)&chr(96+i2)&chr(96+i3)&chr(96+i4)&chr(96+i5)&chr(96+i6)&chr(96+i7)&chr(96+i8)&chr(96+i9)&chr(96+i10)&chr(96+i11)&chr(96+i12))
response.Write("<br>")
end if
next
end if
next
end if
next
end if
next
end if
next
end if
next
end if
next
end if
next
end if
next
end if
next
end if
next
next%>

用C编
也不有个什么算法

<%for i1=1 to 12
for i2=i1+1 to 12
for i3=i2+1 to 12
for i4=i3+1 to 12

全排列还是组合？好象题有岐义

歧义就是重不重复

有顺序就说明是不重复的
哈哈~12层遍历~最基本的方法~不用构思~
我想了半天10分钟快用完了,才想到用冒泡法排序~数据结构中基本的算法

全排列，经典算法
#include <stdio.h>
void permutation(char a[], int m, int n)
{
int i;
char t;
if (m<n-1)
{
permutation(a, m+1, n);
for (i=m+1;i<n;i++)
{
t=a[m];
a[m]=a[i];
a[i]=t;
permutation(a, m+1, n);
t=a[m];
a[m]=a[i];
a[i]=t;
}
}
else
{
printf("%s\n", a);
}
}
int main()
{
char a[]="ABCDEFGHIJKL";
permutation(a, 0,12);
return 0;
}

但是，12层遍历应该更快