1.4插入排序

package array;
/**
 * * 插入排序
 * @author 杨伦亮
 * 1:14:56 AM
 */
public class InsertSort {
	private long[] a;
	private int nElement;
	long time=0;
	/**
	 * 构造函数
	 * 
	 * @param size
	 */
	public InsertSort(int size) {
		a = new long[size];
		nElement=size;
	}
	/**
	 * 更新某个坐标的值
	 * 
	 * @param point
	 * @param value
	 */
	public void setElem(int point, long value) {
		a[point] = value;
	}
	/**
	 * 获得指定坐标值
	 * @param index
	 * @return long
	 */
	public long getElem(int index){
		return a[index];
	}
	/**显示*/
	public void display(){
		for (int i = 0; i<a.length; i++) {
			System.out.print(a[i]+" ");
		}
		System.out.println();
	}
	public  void  displayRunTime() {
		System.out.println("Run Time:"+time);
	}
	/**插入排序*/
	public void insertSort(){
		int in,point;
		for (point=1;point<nElement;point++) {
			in=point;
			long temp=a[point];
			while(in>0&&a[in-1]>=temp){
				a[in]=a[in-1];
				in--;
				time++;
			}
			a[in]=temp;
		}
	}
}