java 快排

package package1;

import java.util.Arrays;
import java.util.Random;

public class T1 {
    public static void quickSort(int[] n) {
        System.out.println(Arrays.toString(n));
        int[] m = Arrays.copyOf(n, 10);
        quickSortUtil(n, 0, n.length - 1);
        System.out.println(Arrays.toString(n));
        Arrays.sort(m);
        System.out.println(Arrays.toString(m));
        System.out.println(Arrays.equals(m, n));
    }

    private static void quickSortUtil(int[] n, int q, int p) {
        if (q >= p)
            return;
        int m = n[q], i = q, j = p;
        while (i < j) {
            while (i < j && n[j] >= m)
                j--;
            n[i] = n[j];
            while (i < j && n[i] < m)
                i++;
            n[j] = n[i];
        }
        n[j] = m;
        quickSortUtil(n, q, j - 1);
        quickSortUtil(n, j + 1, p);
    }

    public static void main(String[] args) {
        Random random = new Random();
        int[] nn = {91, 96, 1, 48, 0, 4, 95, 56, 43, 90};
        int[] n = new int[10];
        for (int j = 0; j < 10; j++) {
            for (int i = 0; i < 10; i++) {
                n[i] = random.nextInt(100);
            }
            quickSort(n);
            System.out.println();
        }
    }
}