85.c

计算概论阅读材料

void fastsort(int *p ,int n)
{
	int m=1,lb[20],ub[20];
	int low,high,i,j,t;
	lb[m]=0;ub[m]=n-1;
	while(m){
		low=lb[m];high=ub[m];m--;
		while(low<high){
			i=low;j=high;t=p[i];
			while(i!=j){
				while(t<=p[j]&&i!=j)
					j--;
				if(i!=j){
					p[i]=p[j],i++;
					while(t>=p[i]&&i!=j)
						i++;
						if(i!=j)p[j]=p[i];
						else
							p[i]=t;
						}
						else p[j]=t;
					}m++;
					if(i-low<=high-i){
						ub[m]=high,lb[m]=i+1;
						high=i-1;
						}
					else{
						ub[m]=i-1;
						lb[m]=low;
						low=i+1;
					}
				}
			}
}
#include <stdio.h>
void main()
{
	int i;
	int ix[]={4,7,2,9,1,6,8,3,5};
	fastsort(ix,9);
	for(i=0;i<9;i++)
		printf("%d",ix[i]);
}