java结构与算法之选择排序

public class ChooseSort {

    int[] array = null;

    @Test
    public void testPopSort() {

        array = new int[5];

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

        int nElmes = array.length;

        int i;
        for (int n = 0; n < nElmes - 1; n++) {
            int min = n;
            for (i = n + 1; i < nElmes; i++) {
                if (array[min] > array[i]) {
                    min = i;
                }
            }
            swap(n, min);
        }
        System.out.println(Arrays.toString(array));

    }

    private void swap(int one, int two) {
        Integer temp = array[one];
        array[one] = array[two];
        array[two] = temp;
    }

}