快速排序

  1. void quick_sort(int q[], int l, int r)
  2. {
  3.     if (l >= r) return; // 判边界
  5.     int i = l - 1, j = r + 1, x = q[(l + r)/2]; // 取分界点 x，和两个指针
  6.     while (i < j) // 每次交换迭代
  7.     {
  8.         do i ++ ; while (q[i] < x);
  9.         do j -- ; while (q[j] > x);
  10.         if (i < j){
  11.             int temp = q[i];
  12.                 q[i] = q[j];
  13.                 q[j] = temp;
  14.         }
  15.     }
  16.     quick_sort(q, l, j),;
  17.     quick_sort(q, j + 1, r);
  18. }

归并排序

  1. int[] temp;//临时数组
  2. void merge_sort(int q[], int l, int r)
  3. {
  4.     if (l >= r) return;
  6.     int mid = (l + r)/2;
  7.     merge_sort(q, l, mid);
  8.     merge_sort(q, mid + 1, r);
  10.     int k = 0, i = l, j = mid + 1;
  11.     while (i <= mid && j <= r){
  12.          if (q[i] <= q[j]) 
  13.             tmp[k ++ ] = q[i ++ ];
  14.         else 
  15.             tmp[k ++ ] = q[j ++ ];
  16.     }
  19.     while (i <= mid) tmp[k ++ ] = q[i ++ ];
  20.     while (j <= r) tmp[k ++ ] = q[j ++ ];
  22.     for (i = l, j = 0; i <= r; i ++, j ++ ) q[i] = tmp[j];
  23. }