java 二分法插入

private static void sort(int[] a) {
    for (int i = 0; i < a.length; i++) {
        int temp = a[i];
        int left = 0;
        int right = i-1;
        int mid = 0;
        //确定要插入的位置
        while(left<=right){
            //先获取中间位置
            mid = (left+right)/2;
            if(temp<a[mid]){
                //如果值比中间值小，让right左移到中间下标-1
                right = mid-1;
            }else{
                //如果值比中间值大,让left右移到中间下标+1
                left = mid+1;
            }
        }
        for (int j = i-1; j >= left; j--) {
            //以左下标为标准，在左位置前插入该数据，左及左后边全部后移
            a[j+1] = a[j];
        }
        if(left != i){
            //左位置插入该数据
            a[left] = temp;
        }
    }
}