快速排序

// from 时代Java - nowjava.com


public class Main {


  public static void quickSort(int A[]) {


    quickSort(A, 0, A.length - 1);

  }


  private static void quickSort(int A[], int start, int end) {


    if (start == end)

      return;


    int q = partition(A, start, end);

    quickSort(A, start, q);

    quickSort(A, q + 1, end);

  }


  private static int partition(int A[], int start, int end) {// 来 自 nowjava.com - 时  代  Java


    int i = start - 1;

    int x = A[end];


    for (int j = start; j < end; j++) {

      if (A[j] < x) {

        int temp = A[j