二分插入排序算法实现

Posted 2021-04-25 朱国柱点滴回忆

//二分插入排序算实现，  时间O(n)=n^2, 空间O(n)=1, 稳定的排序算法实现；        public static void Sort04(int[] arr) {               for (int i = 1; i <  arr.length; i++) {                      int temp = arr[i];                      int  low = 0;                      int high = i-1;                      int mid = 0;                      while (low <= high) {                             mid = (low+high) /  2;                             if (arr[mid] >  temp) {                                    high =  mid-1;                             } else {                                    low =  mid+1;                             }                      }                      for (int j = i-1; j >=  low; j--) {                             arr[j+1] = arr[j];                      }                      arr[low] = temp;               }        }