SWUST OJ 413: Quick Sort

import java.util.Scanner;

public class Main {

	private static int[] quickSort(int[] arr, int left, int right) {
		// 选第一个元素为基准
		int pivot = arr[left];
		int l = left;
		int r = right;

		// 保证l在r左边
		while (l < r) {
			// r左移
			if (l < r && arr[r] > pivot) {
				r--;
			}

			// l右移
			if (l < r && arr[l] < pivot) {
				l++;
			}

			// 判断交换
			if (l < r && arr[l] == arr[r]) {
				l++;
			} else {
				int temp = arr[l];
				arr[l] = arr[r];
				arr[r] = temp;
			}
		}

		// 递归
		if (l - 1 > left) {
			arr = quickSort(arr, left, l - 1);
		}
		if (r + 1 < right) {
			arr = quickSort(arr, r + 1, right);
		}

		return arr;
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int[] arr = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = in.nextInt();
		}

		// 排序
		arr = quickSort(arr, 0, n - 1);

		for (int i = 0; i < n; i++) {
			System.out.print(arr[i] + " ");
		}
		System.out.print("\n");
	}

}