插入排序
ArrayIns.java(插入排序)
package JavaApp_inserSort;
public class ArrayIns {
private long[] a;
private int nElems;
public ArrayIns(int max) {
a = new long[max];
nElems = 0;
}
public void insert(long value) {
a[nElems]=value;
nElems++;
}
public void display(){
for(int j=0;j<nElems;j++){
System.out.print(a[j]+" ");
}
System.out.println();
}
//插入排序
public void insertionSort(){
int in,out;
for(out=1;out<nElems;out++){
long temp=a[out];
in=out;
while(in>0&&a[in-1]>=temp){
a[in]=a[in-1];
in--;
}
a[in]=temp;
}
}
}
InsertSortApp.java(测试类)
package JavaApp_inserSort;
/**
* 插入排序测试类
* @author qingshuang
*
*/
public class InsertSortApp {
public static void main(String[] args) {
int maxSize=100;
ArrayIns arr;
arr=new ArrayIns(maxSize);
arr.insert(77);
arr.insert(99);
arr.insert(44);
arr.insert(55);
arr.insert(22);
arr.insert(88);
arr.insert(11);
arr.insert(00);
arr.insert(66);
arr.insert(33);
arr.display();
arr.insertionSort();
arr.display();
}
}