冒泡，选择，插入，希尔，归并，快排，基数排序

import java.util.LinkedList;
import java.util.Queue;

public class test {

	private static int[] array = new int[] { 100, 1, 99, 45, 6, 3, 10, 55, 44, 66, 111 };

	public static void main(String[] args) {
		// BubbleSort(array);
		// SelectSort(array);
		// InsertSort(array);
		// ShellSort(array);
		// MergeSort(array);
		// QuickSort(array);
		RadixSort(array);
	}

	private static void RadixSort(int[] array) {
		System.out.println("before radixSort : ");
		print(array);
		int max = array[0];
		for (int i = 1; i < array.length; i++) {
			if (max < array[i]) {
				max = array[i];
			}
		}
		int digit = String.valueOf(max).length();
		String[] tmp = new String[array.length];
		for (int i = 0; i < tmp.length; i++) {
			String value = String.valueOf(array[i]);
			int subDigit = digit - value.length();
			while (subDigit-- > 0) {
				value = "0" + value;
			}
			tmp[i] = value;
		}
		Queue<String>[] digitQueue = new LinkedList[10];
		for (int i = 0; i <= 9; i++) {
			digitQueue[i] = new LinkedList<String>();
		}
		for (int i = 0; i < digit; i++) {
			for (int j = 0; j < tmp.length; j++) {
				int index = Integer.valueOf(tmp[j].charAt(digit - 1 - i) - '0');
				digitQueue[index].add(tmp[j]);
			}
			int num = 0;
			for (int p = 0; p <= 9; p++) {
				while (!(digitQueue[p]).isEmpty()) {
					tmp[num] = digitQueue[p].remove();
					num++;
				}
			}
		}
		System.out.println("after radixSort : ");
		for (int i = 0; i < tmp.length; i++) {
			System.out.print(tmp[i] + " ");
		}
		System.out.println();
	}

	private static void print(int[] array) {
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i] + " ");
		}
		System.out.println();
	}

	private static void QuickSort(int[] array) {
		System.out.println("before quickSort : ");
		print(array);
		QuickSort(array, 0, array.length - 1);
		System.out.println("after quickSort : ");
		print(array);
	}

	private static void QuickSort(int[] array, int l, int h) {
		if (l > h || array == null) {
			return;
		} else {
			int p = quickPart(array, l, h);
			QuickSort(array, l, p - 1);
			QuickSort(array, p + 1, h);
		}

	}

	private static int quickPart(int[] array, int l, int h) {
		int key = array[l];
		while (l < h) {
			while (array[h] > key && l < h) {
				h--;
			}
			array[l] = array[h];
			while (array[l] < key && l < h) {
				l++;
			}
			array[h] = array[l];
		}
		array[l] = key;
		return l;
	}

	private static void MergeSort(int[] array) {
		System.out.println("before mergeSort : ");
		print(array);
		MergeSort(array, 0, array.length - 1);
		System.out.println("after mergeSort : ");
		print(array);
	}

	private static void MergeSort(int[] array, int l, int h) {
		if (l < h) {
			int mid = (l + h) >> 1;
			MergeSort(array, l, mid);
			MergeSort(array, mid + 1, h);
			merge(array, l, mid, h);
		}
	}

	private static void merge(int[] array, int l, int mid, int h) {
		int[] tmp = new int[array.length];
		int i = l;
		int iEnd = mid;
		int j = mid + 1;
		int jEnd = h;
		int k = 0;
		while (i <= iEnd && j <= jEnd) {
			if (array[i] < array[j]) {
				tmp[k++] = array[i++];
			} else {
				tmp[k++] = array[j++];
			}
		}
		while (i <= iEnd) {
			tmp[k++] = array[i++];
		}
		while (j < jEnd) {
			tmp[k++] = array[j++];
		}
		for (int index = 0; index < k; index++) {
			array[index + l] = tmp[index];
		}
	}

	private static void ShellSort(int[] array) {
		System.out.println("before shellSort : ");
		print(array);
		int gap = array.length / 2;
		while (gap > 0) {
			for (int i = gap; i < array.length; i++) {
				for (int j = i - gap; j >= 0 && array[j] > array[j + gap]; j -= gap) {
					int tmp = array[j + gap];
					array[j + gap] = array[j];
					array[j] = tmp;
				}
			}
			gap /= 2;
		}
		System.out.println("after shellSort : ");
		print(array);
	}

	private static void InsertSort(int[] array) {
		System.out.println("before insertSort : ");
		print(array);
		for (int i = 1; i < array.length; i++) {
			for (int j = i; j > 0 && array[j] < array[j - 1]; j--) {
				int tmp = array[j - 1];
				array[j - 1] = array[j];
				array[j] = tmp;
			}
		}
		System.out.println("after insertSort : ");
		print(array);

	}

	private static void SelectSort(int[] array) {
		System.out.println("before selectSort : ");
		print(array);
		for (int i = 0; i < array.length; i++) {
			for (int j = i + 1; j < array.length; j++) {
				if (array[i] > array[j]) {
					int tmp = array[j];
					array[j] = array[i];
					array[i] = tmp;
				}
			}
		}
		System.out.println("after selectSort : ");
		print(array);
	}

	private static void BubbleSort(int[] array) {
		System.out.println("before bubbleSort : ");
		print(array);
		for (int i = array.length - 1; i > 0; i--) {
			for (int j = 0; j < i; j++) {
				if (array[j] > array[j + 1]) {
					int tmp = array[j + 1];
					array[j + 1] = array[j];
					array[j] = tmp;
				}
			}
		}
		System.out.println("after bubbleSort : ");
		print(array);
	}
}