The-Quick-Sort.rar_Quick_希尔排序

#include <stdio.h> int x[1000][10];//开一个数组来储存每一趟的结果 int j;//全局变量j作为计数器 quick(int first,int end,int L[]) { int left=first,right=end,key; key=L[first]; while(left<right) { while((left<right)&&(L[right]>=key)) right--; if(left<right) L[left++]=L[right]; while((left<right)&&(L[left]<=key)) left++; if(left<right) L[right--]=L[left]; } L[left]=key; return left; } quick_sort(int L[],int first,int end) { int split,ii; //记录每一趟的排序结果 j++; for(ii=0;ii<10;ii++) x[j][ii]=L[ii]; // if(end>first) { split=quick(first,end,L); quick_sort(L,first,split-1); quick_sort(L,split+1,end); } } void main() { int a[10],i,k; j=0;//初始化计数器j printf("Please type in 10 numbers:"); for(i=0;i<10;i++) scanf("%d",&a[i]); quick_sort(a,0,9); printf("The result of this sort is:"); for(i=0;i<10;i++) printf(" %d",a[i]); printf("\n"); printf("\nThe times of this quick sort are:%d\n",j); printf("\nWhich time do you want to see?:"); scanf("%d",&k); for(i=0;i<10;i++) printf(" %d",x[k+1][i]); printf("\n"); }