java 实现 快速排序

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in); 
        int n = scanner.nextInt();   //输入数据个数n
        int[] num = new int[n];
        for (int i = 0; i < n; i++) {    //连续输入n个待排序的数
            num[i] = scanner.nextInt();
        }
        QuickSort(num, 0, n - 1);  //调用快速排序
        for (int i = 0; i < n; i++) {
            System.out.print(num[i]+" ");
        }
    }

    static void QuickSort(int a[], int sta, int end) {
        if (sta < end) {
            int q = paititon(a, sta, end);
            QuickSort(a, sta, q - 1);
            QuickSort(a, q + 1, end);
        }
    }

    static int paititon(int a[], int sta, int end) {
        int i = sta, j = end + 1;
        int temp = a[i];
        while (true) {
            while (a[++i] < temp && i < end) ;
            while (a[--j] > temp) ;
            if (i >= j) break;
            swap(a, i, j);
        }
        swap(a, sta, j);
        return j;
    }

    static void swap(int num[], int a, int b) {
        int temp = num[a];
        num[a] = num[b];
        num[b] = temp;
    }

}