排序02--[插入排序&&插入排序优化&&二分搜索]

1.基本介绍

 

 

 1.2baseline算法实现

    @Override
    protected void sort() {
        for (int begin = 1; begin < array.length; begin++) {
            int cur = begin;
            while (cur > 0 && cmp(cur, cur - 1) < 0) {
                swap(cur, cur - 1);
                cur--;
            }
        }
    }

View Code