package exp_sort;
public class QuickSort {
  public static void Qsort(int array[], int left, int right) {
    int pos;
    if (left < right) {
      pos = quickSort(array, left, right);
      //递归排序
      Qsort(array, left, pos - 1);
      Qsort(array, pos + 1, right);
    }
  }
  /**
   * 一趟快速排序
   *
   * @param array
   * @param left
   * @param right
   * @return
   */
  public static int quickSort(int array[], int left, int right) {
    int low, high;
    int temp = array[left]; // 选择基准记录（枢纽元）
    low = left;
    high = right;
    while (low < high) {
      // high从右到左找小于temp的记录
      while (low < high && array[high] >= temp) {
        high--;
      }
      // 找到小于temp的记录则交换
      if (low < high) {
        array[low] = array[high];
        low++;
      }
      // low从左到右找到大于temp的记录
      while (low < high && array[low] < temp) {
        low++;
      }
      // 找到大于temp的记录，则交换
      if (low < high) {
        array[high] = array[low];
        high--;
      }
    }
    //将游标放在当前位置，此时low=high
    array[low] = temp;
    return low;
  }
  public static void main(String[] args) {
    // TODO Auto-generated method stub
    int array[] = { 38, 62, 35, 77, 55, 14, 35, 98 };
    Qsort(array, 0, 7);
    for (int i = 0; i < array.length; i++) {
      System.out.print(array[i] + " ");
    }
    System.out.println("n");
  }
}