快速排序源代码

#include <iostream>using namespace std;int quickSort(int *array,int x,int y){int low=x,high=y;int key=array[x];if(low>high)return 1;if(low==high)return 0;while(low<high){while(low<high&&array[high]>=key)high--;array[low]=array[high];while(low<high&&array[low]<=key)low++;array[high]=array[low];}array[low]=key;quickSort(array,x,low-1);quickSort(array,low+1,y);return 0;}int main(){int a[10] = {0,2,0,-3,-4,12,4,23,1,8};//q_sort(a, 0, 10-1);quickSort(a,0,10-1);for(int i=0; i<10; i++) cout << a[i] << endl;return 0;}