#include <stdio.h>
#include <stdlib.h>
int main(void)
{
int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z,tmp;
printf("Please enter 26 numbers:\n");
scanf("%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f,&g,&h,&i,&j,&k,&l,&m,&n,&o,&p,&q,&r,&s,&t,&u,&v,&w,&x,&y,&z);
while(!(a<=b&&b<=c&&c<=d&&d<=e&&e<=f&&f<=g&&
g<=h&&h<=i&&i<=j&&j<=k&&k<=l&&l<=m&&
m<=n&&n<=o&&o<=p&&p<=q&&q<=r&&r<=s&&
s<=t&&t<=u&&u<=v&&v<=w&&w<=x&&x<=y&&y<=z));
printf("%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d\n",a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z);
return 0;
}
最好的复杂度: O(n)
最坏的复杂度: O(infinity) [在你没有强制关程序的前提下，否则不会输出]

下面一个是:
Intelligent Designed "Intelligent Design Sort"
Just praise for a "Intelligent Design Sort" algorithm appear on the blank position above.
It takes no time at all.

这两货大概算排序"算法"吧...

挽尊
\

感觉跟炮姐写的好象

挽, 这个笑话不太冷...

还不如写个bogo排序