插入排序

/**
 * 插入排序
 *
 */
public class ArrayIns {
	
	private long[] a;
	private int nElens;
	
	public ArrayIns(int max){
		a = new long[max];
		nElens = 0;
	}
	
	public void insert(long value){
		a[nElens] = value;
		nElens++;
	}
	
	public void display(){
		for (int i = 0; i < nElens; i++) {
			System.out.print(a[i]+" ");
		}
		System.out.println(" ");
	}
	
	public void insertionSort(){
		int in,out;
		for ( out = 1; out < nElens; out++) {
			long temp = a[out];
			in = out ;
			while (in>0&&a[in-1]>temp) {
				a[in]=a[in-1];
				--in;
			}
			a[in]=temp;
			
		}
	}
}

/**
 * 插入排序实例
 *
 */
public class InserSortApp {
	
	public static void main(String[] args) {
		int maxSize = 100;
		ArrayIns arr;
		arr = new ArrayIns(maxSize);
		arr.insert(77);
		arr.insert(88);
		arr.insert(12);
		arr.insert(53);
		arr.insert(23);
		arr.insert(17);
		arr.insert(99);
		arr.insert(58);
		arr.insert(1);
		arr.insert(49);
		System.out.println("排序前：");
		arr.display();
		
		arr.insertionSort();
		System.out.println("排序后：");
		arr.display();
		
	}
}