Java常用排序算法

// 交换元素
private static void swap(int[] data, int i, int j) {
	data[i] ^= data[j];
	data[j] ^= data[i];
	data[i] ^= data[j];
}
// 冒泡排序
public static void bubbleSort(int[] data) {
	int temp = 0;
	for (int i = 0; i < data.length - 1; i++) {
		for (int j = i + 1; j < data.length; j++) {
			if (data[j] < data[i]) {
				swap(data, i, j);
			}
		}
	}
}
// 选择排序
public static void selectSort(int[] data) {
	int iTemp = 0;
	int iPos = 0;
	for (int i = 0; i < data.length - 1; i++) {
		iTemp = data[i];
		iPos = i;
		for (int j = i + 1; j < data.length; j++) {
			if (iTemp > data[j]) {
				iTemp = data[j];
				iPos = j;
			}
		}
		data[iPos] = data[i];
		data[i] = iTemp;
	}
}
// 插入排序
public static void insertSort(int[] data) {
	for (int i = 1; i < data.length; i++) {
		for (int j = i; j > 0 && data[j] < data[j - 1]; j--) {
			swap(data, j, j - 1);
		}
	}
}
// Shell排序
public static void shellSort(int[] data) {
	for (int i = data.length / 2; i > 2; i /= 2) {
		for (int j = 0; j < i; j++) {
			toolShellSort(data, j, i);
		}
	}
	toolShellSort(data, 0, 1);
}	
private static void toolShellSort(int[] data, int start, int inc) {
	for (int i = start + inc; i < data.length; i += inc) {
		for (int j = i; j >= inc && data[j] < data[j - inc]; j -= inc) {
			swap(data, j ,j - inc);
		}
	}
}
// 鸽巢排序
public static void pigeonholeSort(int[] data, int buffer) {
	int j = 0;
	int[] auxiliary = new int[buffer + 1];
	for (int i = 0; i < data.length; i++) {
		auxiliary[data[i]]++;
	}
	for (int i = 0; i < buffer + 1; i++) {
		for (int k = 0; k < auxiliary[i]; k++) {
				data[j++] = i;
		}
	}
}