快速排序基本实现

int Median3(int A[],int Left,int Right){int Center=(Left+Right)/2;if(A[Left]>A[Center])swap(&A[Center],&A[Left]);if(A[Left]>A[Right])swap(&A[Left],&A[Right]);if(A[Center]>A[Right])swap(&A[Center],&A[Right]);swap(&A[Center],&A[Right-1]);return A[Right-1];
}void QSort(int A[],int Left,int Right){int Pivot,Cutoff,Low,High;if(Cutoff<=Right-Left){Pivot=Median3(A,Left,Right);Low=Left;High=Right-1;while(1){while(A[++Low]<Pivot);while(A[--High]>Pivot);if(Low>=High)break;swap(&A[Low],&A[High]);}swap(&A[Low],&A[Right-1]);QSort(A,Left,Low-1);QSort(A,Low+1,Right);}else{Insert_Sort(A+Left,Right-Left+1);}
}void QuickSort(int A[],int N){
//	统一接口 Qsort(A,0,N-1);
}