插入排序（二分优化）（java）

核心code：

public class insertsort {
    public insertsort() {
    }

    public static void main(String[] args) {
        int[] a = new int[]{1, 4, 3, 5, 2, 7};
        insertsort insertsort = new insertsort();
        insertsort.insert(a);
        int[] var3 = a;
        int var4 = a.length;

        for(int var5 = 0; var5 < var4; ++var5) {
            int b = var3[var5];
            System.out.println(b);
        }

    }

    public int[] insert(int[] a) {
        for(int i = 1; i < a.length - 1; ++i) {
            int lift = 0;
            int right = i - 1;
            int mid = false;
            int temp = a[i];

            while(lift <= right) {
                int mid = (lift + right) / 2;
                if (a[mid] < a[i]) {
                    lift = mid + 1;
                } else {
                    right = mid - 1;
                }
            }

            if (a[lift] > a[i]) {
                for(int j = i; j >= lift + 1; --j) {
                    a[j] = a[j - 1];
                }

                a[lift] = temp;
            }
        }

        return a;
    }
}