结构与算法之插入排序

public class InsertSort {
    int[] array = null;

    @Test
    public void testInsertSort() {

        array = new int[5];

        array[0] = 45;
        array[1] = 22;
        array[2] = 33;
        array[3] = 43;
        array[4] = 34;

        int nElmes = array.length;
        for (int i = 1; i < nElmes; i++) {
            if (array[i - 1] > array[i]) {
                int temp = array[i];
                int j = i;
                while (j > 0 && array[j - 1] > temp) {
                    array[j] = array[j - 1];
                    j--;
                }
                array[j] = temp;
            }
        }

        System.out.println(Arrays.toString(array));
    }

}