快速排序

int partion(int *arr,int low,int heigh) { int key=arr[low]; while(low < heigh) { while(low < heigh && arr[heigh] >=key) --heigh; arr[low]=arr[heigh]; while(low < heigh && arr[low] <= key) ++low; arr[heigh]=arr[low]; } arr[low]=key; return low; } void quick_sort(int *arr,int low,int heigh) { assert(arr); if(low <heigh) { int mid=partion(arr,low,heigh); quick_sort(arr,low,mid); quick_sort(arr,mid+1,heigh); } }