快速排序

import java.util.*;
 
public class QuickSort {
        public int[] quickSort(int[] A, int n) {
        quickSortRecurrence(A, 0, n - 1);
        return A;
    }
     
    public void quickSortRecurrence(int[] A, int start, int end){
        System.out.println("[" + start + "," + end + "]" + (start < end));
        if(start < end){
            int mid = A[end];
            int counter = start;
            for (int i = start; i < end; i++ ){
                if(A[i] < mid){ 
                    swap(A, counter, i);
                    counter = counter + 1;
                }
            } 
            swap(A, counter, end);
            quickSortRecurrence(A, start, counter - 1);
            quickSortRecurrence(A, counter + 1, end);
        } 
    }
     
    public boolean swap(int[] A, int n1, int n2){
        if(n1 != n2){
            int temp = A[n1];
            A[n1] = A[n2];
            A[n2] = temp;
            return true;
        } else {
            return false;
        }
         
    }
}