折半插入排序

来源：互联网发布：富途牛牛安全吗知乎编辑：程序博客网时间：2024/06/15 08:04
/** * 折半插入排序 */public class BinaryInsertSort {    public static void binaryInsertSort(DataWrap[] data) {        System.out.println("开始排序");        int arrayLength = data.length;        for (int i = 1; i < arrayLength; i++) {            DataWrap temp = data[i];            int low = 0;            int high = i - 1;            while (low <= high) {                int mid = (low + high) / 2;                if (temp.compareTo(data[mid]) > 0) {                    low = mid + 1;                } else {                    high = mid - 1;                }            }            for (int j = i; j > low; j--) {                data[j] = data[j - 1];            }            data[low] = temp;            System.out.println(java.util.Arrays.toString(data));        }    }    public static void main(String[] args) {        DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),                new DataWrap(21, "*"), new DataWrap(23, ""),                new DataWrap(-30, ""), new DataWrap(-49, ""),                new DataWrap(21, ""), new DataWrap(30, "*"),                new DataWrap(30, "")};        System.out.println("排序之前：\n" + java.util.Arrays.toString(data));        binaryInsertSort(data);        System.out.println("排序之后：\n" + java.util.Arrays.toString(data));    }}
0 0