我正在尝试一种就地合并排序，它使用旋转对项目进行排序。问题在于，它适用于降序排列的两个项目数的幂，而不适用于其他排列或项目数：

def binary_search_middle(array, start, middle, end):
    a = 0
    b = min(middle - start, end - (middle + 1)) + 1
    M = (a + b) // 2

    while a < b:
        if array[middle - M] > array[(middle + 1) + M]:
            a = M + 1
        else:
            b = M
        M = (a + b) // 2

    return M

def rotate(array, start, end, size):
    for i in range(start, end + 1):
        array[i], array[i + size] = array[i + size], array[i]

def merge(array, start, middle, end):
    size  = binary_search_middle(array, start, middle, end) + 1
    left  = middle - (size - 1)
    right = (middle + 1) + (size - 1)

    while size > 0 and right <= end:
        rotate(array, left, middle, size)
        merge(array, middle + 1, right, end)
        end    = middle
        middle = left
        size   = binary_search_middle(array, start, middle, end)

def in_place_merge_sort(array):
    last = len(array) - 1
    size = 1

    while size <= last:
        for i in range(0, last + 1, 2 * size):
            middle = i + size - 1
            end    = min(middle + size, last)
            merge(array, i, middle, end)
        size = 2 * size

有什么问题吗？