array, vector 排序算法 2

array 快速排序:

void quick_sort(int unsorted[], int left, int right){

   int i = left;

   int j = right;

  int tmp;

  int pivot = unsorted[(left + right)/2];

  while (i <= j){

       while(unsorted[i] < pivot)  i ++;

       while(unsorted[j] > pivot)  j --;

       if (i <= j){

           tmp = unsorted[i];

           unsorted[i] = unsorted[j];

           unsorted[j] = tmp;

           i ++;

           j --;

       }

  }

 if (left < j) quick_sort(unsorted, left, j);

 if (i < right) quick_sort(unsorted, i, right);

}