摘要：
1 void sort(int *nums, int l, int mid, int r){ 2 int *tmp, i, lsub, rsub, len; 3 4 len = r-l+1; 5 lsub = l; 6 rsub = mid+1; 7 8 tmp = malloc(sizeof(in 阅读全文
摘要：
1 void quickSort(int *nums, int n, int i, int j) { 2 int base, tmp, this_begin, this_end; 3 if (i<0 || j >= n) 4 return; 5 if (i >= j) 6 return ; 7 th 阅读全文