快速排序之挖坑填补法

快速排序

代码：

#include<stdio.h>#include<stdlib.h>/*快速排序--------挖坑填补法*/int  QuickSort(int a[],int nlow,int nhigh){int key =a[nlow];while(nlow < nhigh){//从后向前，找第一个比key 小的while(nlow < nhigh && a[nhigh] >= key){nhigh--;}//找到比key 小的，填到坑nlow 位置， nhigh 变成坑 if(nlow < nhigh)a[nlow] = a[nhigh];//从前向后找比key 大的，放到坑nhigh中 while (nlow < nhigh && a[nlow] <= key){nlow++;}if(nlow < nhigh)a[nhigh] = a[nlow];}a[nlow] = key;//返回基准位置return nlow;}//递归void Sort(int a[],int nlow,int nhigh){int key ;if(a==NULL || nlow >= nhigh) return ;//找到基准 key key= QuickSort(a,nlow,nhigh);Sort(a,nlow,key-1);Sort(a,key+1,nhigh);}int main(){int a[]={2,4,8,88,2,1,3,4,5,11,7,0,9};int n = sizeof(a)/sizeof(a[0]);int i=0;Sort(a,0,n-1);for(i=0;i<n;i++){printf("%d ",a[i]);}printf("\n");system("pause");return 0;}