排序算法 选择排序

/**
 * Created by lx on 2016/10/20.
 */
public class SortTest {
    public void print(int[] l) {
        for (int i = 0; i < l.length; i++) {
            System.out.print(l[i]);
        }
    }
    public void insertsort(int[] l) {
        int flag;
        int j;
        for (int i = 1; i < l.length; i++) {
            if (l[i] < l[i - 1]) {
                //移动
                flag = l[i];
                for (j = i - 1; j >= 0 && flag < l[j]; j--) {
                    l[j + 1] = l[j];
                }
                l[j + 1] = flag;
            }
        }
    }

    public static void main(String[] args) {
        int[] array = new int[]{8, 7, 6, 5, 4, 3, 2, 1};
        SortTest test = new SortTest();
        test.print(array);
        test.insertsort(array);
    }
}