数据结构与算法(JAVA版)3_6:快速排序

package com.inspire.chapter3;

import java.util.Arrays;

public class FastSort {

	public static void main(String[] args) {

		// 快速排序的时间复杂度O(N*logN)
		int testTime = 500;
		int maxSize = 100;
		int maxValue = 100;
		boolean succeed = true;
		for (int i = 0; i < testTime; i++) {
			int[] arr1 = generateRandomArray(maxSize, maxValue);
			int[] arr2 = copyArray(arr1);
			Arrays.sort(arr1);
			process(arr2, 0, arr1.length - 1);
			if (!isEqual(arr1, arr2)) {
				succeed = false;
				break;
			}
		}
		System.out.println(succeed ? "Nice!" : "Oops!");

	}

	private static void process(int[] arr, int l, int r) {
		if (l >= r) {
			return;
		}
		swap(arr, l + (int) (Math.random() * (r - l + 1)), r);
		int[] equalArea = netherlandsFlag(arr, l, r);
		process(arr, l, equalArea[0] - 1);
		process(arr, equalArea[1] + 1, r);
	}


	public static int[] netherlandsFlag(int[] arr, int L, int R) {
		if (L > R) {
			return new int[] { -1, -1 };
		}
		if (L == R) {
			return new int[] { L, R };
		}
		int less = L;//小于区的下标
		int more = R;//大于区的下标
		int index = L;//记录当前值
		while (index < more) {
			if (arr[index] == arr[R]) {//当前值和最右边的值相等，啥也不做
				index++;
			} else if (arr[index] < arr[R]) {//当前值小于最右边的值，交换，并且当前值++,小于区下标也++
				swap(arr, index++, less++);
			} else {//当前值比最右边的值大，则当前值与最右边的上一个值交换，并且大于区的下标--
				swap(arr, index, --more);
			}
		}
		swap(arr, more, R);//最后，把最右边的值和大于区的上一个值交换
		return new int[] { less + 1, more };
	}

	private static void swap(int[] arr, int p, int i) {
		int temp = arr[p];
		arr[p] = arr[i];
		arr[i] = temp;
	}

	private static void printf(int[] arr) {
		for (int i : arr) {
			System.out.print(i + " ");
		}
		System.out.println();
	}

	// for test
	public static int[] generateRandomArray(int maxSize, int maxValue) {
		int[] arr = new int[(int) ((maxSize + 1) * Math.random())];
		for (int i = 0; i < arr.length; i++) {
			arr[i] = (int) ((maxValue + 1) * Math.random()) - (int) (maxValue * Math.random());
		}
		return arr;
	}

	// for test
	public static int[] copyArray(int[] arr) {
		if (arr == null) {
			return null;
		}
		int[] res = new int[arr.length];
		for (int i = 0; i < arr.length; i++) {
			res[i] = arr[i];
		}
		return res;
	}

	// for test
	public static boolean isEqual(int[] arr1, int[] arr2) {
		if ((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)) {
			return false;
		}
		if (arr1 == null && arr2 == null) {
			return true;
		}
		if (arr1.length != arr2.length) {
			return false;
		}
		for (int i = 0; i < arr1.length; i++) {
			if (arr1[i] != arr2[i]) {
				return false;
			}
		}
		return true;
	}

}