快速排序算法

import java.util.Arrays;

public class Code05_QuickSort {
    private static void quickSort(int[] array, int start, int end){
        if (start < end){
            int key = array[start];
            int i = start;
            for (int j = start + 1; j <= end; j++){
                if (key > array[j]){
                    swap(array, j, ++i);
                }
            }
            array[start] = array[i];
            array[i] = key;
            quickSort(array, start, i - 1);
            quickSort(array, i + 1, end);
        }
    }
    //替换位置方法
    public static void swap(int[] arr, int i, int j){
        int tmp = arr[j];
        arr[j] = arr[i];
        arr[i] = tmp;
    }
    /*
     //替换位置方法
    public static void swap(int[]arr, int i, int j){
        if (i != j){
            arr[i] ^= arr[j];
            arr[j] ^= arr[i];
            arr[i] ^= arr[j];
        }
    }
     */
    public static void main(String[] args){
        int[] array = {2,9,-9,7,-6,8,0};
        quickSort(array, array.length-array.length,array.length-1);
        System.out.println("array=" + Arrays.toString(array));
    }
}