手写快速排序

void quickSort(int *arr,int head,int tail) {    int h=head , t=tail;    int mid = arr[(h+t)/2];    while(h < t) {        while(arr[h] < mid)             h ++;        while(arr[t] > mid)             t --;        if(h <= t) {            int tmp = arr[h];            arr[h] = arr[t];            arr[t] = tmp;            h ++;            t --;            }        }        if(head < t)        quickSort(arr,head,t);    if(h < tail)         quickSort(arr,h,tail);}