编辑代码

#include <stdio.h>

void binaryInsertionSort(int arr[], int n) {
    int i, j, key, low, high, mid;
    for (i = 1; i < n; i++) {
        key = arr[i];
        low = 0;
        high = i - 1;

        // 使用折半查找确定插入位置
        while (low <= high) {
            mid = (low + high) / 2;
            if (key < arr[mid])
                high = mid - 1;
            else
                low = mid + 1;
        }

        // 将比 key 大的元素向右移动
        for (j = i - 1; j >= low; j--) {
            arr[j + 1] = arr[j];
        }

        arr[low] = key;
    }
}

int main() {
    int arr[] = {45, 31, 16, 18, 215, 11, 12};
    int n = sizeof(arr) / sizeof(arr[0]);

    printf("原始数组：\n");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }

    printf("\n\n排序后的数组：\n");
    binaryInsertionSort(arr, n);
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}