递归版快速排序

             这是我企业导师写的快速排序！感觉挺好...跟一般的快速排序不同, 它把普通递归的快排, 二合一了！

void quicksort(int *list, int low, int high){if( low<high ){int i = low, j = high, mid = (low+high)/2;int v = list[mid];if(mid != low){list[mid] = list[low];list[low] = v;}while( i<j ){while( i<j && list[j] >= v ){ j--; }if( i<j ){list[i++] = list[j];}while( i<j && list[i] <= v){ i++; }if( i<j ){list[j--] = list[i];}}list[i] = v;quicksort(list, low, i-1);quicksort(list, i+1, high);}}