QuickSort

快速排序（Quicksort）是对冒泡排序的一种改进快速排序主要是在数据量庞大又基本无序的情况下。效率是十分明显的。

package com.citi.byteman.test.arithmatic;

public class QuickSort {

	public int getMiddle(int[] list, int low, int high) {
		int tmp = list[low];
		while (low < high) {
			while (low < high && list[high] > tmp) {
				high--;
			}
			list[low] = list[high];
			while (low < high && list[low] < tmp) {
				low++;
			}
			list[high] = list[low];
		}
		list[low] = tmp;
		return low;
	}

	public void sort(int[] list, int low, int high) {
		int middle = getMiddle(list, low, high);
		if (low < high) {
			sort(list, low, middle - 1);
			sort(list, middle + 1, high);
		}
	}

	public void quickSort(int[] list) {
		sort(list, 0, list.length - 1);
	}

	public void printArray(int[] array) {
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i] + "\t");
		}
		System.out.println("");
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		QuickSort quickSort = new QuickSort();
		// TODO Auto-generated method stub
		int[] list = { 34, 3, 53, 2, 23, 7, 14, 10 };
		System.out.println("Before sort:");
		quickSort.printArray(list);
		System.out.println("After sort:");
		quickSort.quickSort(list);
		quickSort.printArray(list);
	}

}