java算法：插入排序

java算法：插入排序

如，对EXAMPLE 字母进行排序：
E X A M P L E 开始
E [X] A M P L E E<X 不变
[A] E X M P L E A < E：A插入到E前
A E [M] X P L E ...
A E M [P] X L E
A E [L] M P X E
A E [E] L M P X

Java代码

1. publicclassInsertion{
3. publicstaticvoidmain(String[]args){
4. intn=20;
5. MyItem[]a=newMyItem[n];
6. for(inti=0;i<n;i++){
7. a[i]=newMyItem();
8. a[i].rand();
9. }
11. for(inti=0;i<n;i++){
12. System.out.print(a[i]+"");
13. }
15. insertion(a,0,n);
16. System.out.println("");
17. print(a,n);
18. }
20. privatestaticvoidprint(MyItema[],intn){
21. for(inti=0;i<n;i++){
22. System.out.print(a[i]+"");
23. }
24. }
26. publicstaticvoidinsertion(MyItem[]a,intl,intr){
27. inti;
28. for(i=r-1;i>=l+1;i--){
29. compExch(a,i-1,i);
30. }
31. for(i=l+2;i<r;i++){
32. intj=i;
33. MyItemv=a[i];
34. while(less(v,a[j-1])){
35. a[j]=a[j-1];
36. j--;
37. }
38. a[j]=v;
39. }
40. }
42. publicstaticbooleanless(Itemv,Itemw){
43. returnv.less(w);
44. }
46. publicstaticvoidexch(Item[]a,inti,intj){
47. Itemt=a[i];
48. a[i]=a[j];
49. a[j]=t;
50. }
52. publicstaticvoidcompExch(Item[]a,inti,intj){
53. if(less(a[j],a[i])){
54. exch(a,i,j);
55. }
56. }
57. }

public class Insertion {

	public static void main(String[] args) {
		int n = 20;
		MyItem [] a = new MyItem[n];
		for (int i = 0; i < n; i++) {
			a[i] = new MyItem();
			a[i].rand();
		}
		
		for (int i = 0; i < n; i++) {
			System.out.print(a[i] + " ");
		}
		
		insertion(a, 0, n);
		System.out.println("");
		print(a, n);
	}
	
	private static void print(MyItem a [], int n){
		for (int i = 0; i < n; i++) {
			System.out.print(a[i] + " ");
		}
	}
	
	public static void insertion(MyItem [] a, int l, int r){
		int i;
		for(i = r - 1; i >= l + 1; i--){
			compExch(a, i-1, i);
		}
		for (i = l + 2; i < r; i++){
			int j = i;
			MyItem v = a[i];
			while(less(v, a[j - 1])){
				a[j] = a[j - 1]; 
				j--;
			}
			a[j] = v;
		}
	}
	
	public static boolean less(Item v, Item w){
		return v.less(w);
	}
	
	public static void exch(Item [] a, int i, int j){
		Item t = a[i];
		a[i] = a[j];
		a[j] = t;
	}
	
	public static void compExch(Item [] a, int i, int j){
		if(less(a[j],a[i])){
			exch(a, i, j);
		}
	}
}

插入排序的运行时间主要依赖于输入文件中关键字的最初顺序。如，文件很大而且关键字已经排好（或者几乎排好），那么插入排序运算就很快了，而选择排序运行却很慢。