插入排序

//InsertArray.java
public class InsertArray {
	private int[] a;

	private int nElements;

	public InsertArray(int max) {
		a = new int[max];
		nElements = 0;
	}

	public void insert(int element) {
		if (nElements == a.length) {
			System.out.println("can't insert element because the array is beyond size.");
			return;
		}
		a[nElements] = element;
		nElements++;
	}

	public void insertSort() {
		int out, in, temp;
		for (out = 1; out < nElements; out++) {
			temp = a[out];
			in = out;
			while (in > 0 && a[in - 1] >= temp) {
				a[in] = a[in - 1];
				--in;
			}
			a[in] = temp;
		}
	}

	public void display() {
		StringBuffer sb = new StringBuffer();
		sb.append("[");
		int j;
		for (j = 0; j < a.length; j++) {
			sb.append(a[j] + ",");
		}
		sb.deleteCharAt(sb.length() - 1);
		sb.append("]");
		System.out.println(sb.toString());
	}
}

//Main.java
public class Main {
	public static void main(String[] args){
		InsertArray insertArray = new InsertArray(10);
		insertArray.insert(2);
		insertArray.insert(5);
		insertArray.insert(6);
		insertArray.insert(3);
		insertArray.insert(4);
		insertArray.insert(1);
		insertArray.display();
		insertArray.insertSort();
		insertArray.display();
	}
}

输出结果：

[2,5,6,3,4,1,0,0,0,0]
[1,2,3,4,5,6,0,0,0,0]