排序学习

排序算法类模板

private static boolean less(Comparable v, Comparable w){
	 return v.compareTo(w) < 0;
 }
private static void exch(Comparable[] a, int i, int j){ 
	Comparable t = a[i]; a[i] = a[j]; a[j] = t;
 }
private static void show(Comparable[] a){ // 在单行中打印数组
	for (int i = 0; i < a.length; i++)
	StdOut.print(a[i] + " ");
	StdOut.println();
}
public static boolean isSorted(Comparable[] a){ // 测试数组元素是否有序
	for (int i = 1; i < a.length; i++)
	if (less(a[i], a[i-1])) return false;
	return true;
}

选择排序

public class Selection{
   public static void sort(Comparable[] a){ // 将a[]按升序排列
	int N = a.length; // 数组长度
	for (int i = 0; i < N; i++){ // 将a[i]和a[i+1..N]中最小的元素交换
		int min = i; // 最小元素的索引
		for (int j = i+1; j < N; j++)
			if (less(a[j], a[min])) min = j;
		exch(a, i, min);
	}
   }
}

插入排序

public static void  sort1(Comparable[] a) {
		for (int i = 0; i < a.length; i++) {
			for (int j = i; j >0&&less(a[j], a[j-1]); j--) {
				exch(a, j, j-1);
			}
		}
	}

希尔排序

public static void shell(Comparable[] a) {
		int h=1;
		while (h<a.length/3) {
			h=3*h+1;
		}
		while (h>=1) {
			for (int i = h; i < a.length; i++) {
				for (int j = i; j >=h&&less(a[j], a[j-h]); j-=h) {
					exch(a, j, j-h);
				}
			}
			h=h/3;
		}
	}