#include<iostream> using namespace std; void quickSort(int A[],int,int); int main() { int A[]={49,38,65,97,76,13,27,50},i; int len=sizeof(A)/sizeof(int); cout<<"这组原始数据为:"<<endl; for(i=0;i<len;i++) cout<<A[i]<<","; cout<<endl; quickSort(A,0,len-1); cout<<"排序后的数据:"<<endl; for(i=0;i<len;i++) cout<<A[i]<<","; cout<<endl; return 0; } void quickSort(int s[], int l, int r) { if (l< r) { int i = l, j = r, x = s[l]; while (i < j) { while(i < j && s[j]>= x) j--; if(i < j) s[i++] = s[j]; while(i < j && s[i]< x) i++; if(i < j) s[j--] = s[i]; } s[i] = x; quickSort(s, l, i - 1); quickSort(s, i + 1, r); } }