数据结构——快速排序
#include
int partition(int A[], int low, int high){
// 19,3,6,9,2,4
int privot = A[low];// 19 0
while(low= privot) --high;
A[low] = A[high];//
while(low #include
int partition(int A[], int low, int high){
// 19,3,6,9,2,4
int privot = A[low];// 19 0
while(low= privot) --high;
A[low] = A[high];//
while(low