如何在不使用比较器的情况下对充满空值的数组进行排序？

def partition(arr, low, high):
    i = low - 1
    pivot = arr[high]
    
    for j in range(low, high):
        if arr[j] is not None and (arr[j] < pivot or arr[j] is None):
            i += 1
            arr[i], arr[j] = arr[j], arr[i]
    
    arr[i+1], arr[high] = arr[high], arr[i+1]
    return i+1

def quickSort(arr, low, high):
    if low < high:
        pi = partition(arr, low, high)
        quickSort(arr, low, pi-1)
        quickSort(arr, pi+1, high)

def sortArray(arr):
    n = len(arr)
    count = 0
    
    for i in range(n):
        if arr[i] is None:
            count += 1
        else:
            arr[i-count] = arr[i]
    
    quickSort(arr, 0, n-count-1)
    
    for i in range(n-count, n):
        arr[i] = None
    
    return arr