我正在尝试计算这个堆排序算法中的比较次数：

import random
import time

#HeapSort Algorithm
def heapify(arr, n, i):
    count = 0
    largest = i  
    l = 2 * i + 1     
    r = 2 * i + 2     
    if l < n and arr[i] < arr[l]:
        largest = l
    if r < n and arr[largest] < arr[r]:
        largest = r
    if largest != i:
        count += 1
        arr[i],arr[largest] = arr[largest],arr[i]
        heapify(arr, n, largest)
    return count

def heapSort(arr):

    n = len(arr)
    count = 0
    for i in range(n, -1, -1):
        heapify(arr, n, i)  
        count += heapify(arr, i, 0)
    for i in range(n-1, 0, -1):
        arr[i], arr[0] = arr[0], arr[i] 
        heapify(arr, i, 0)

    return count

print("For n = 1000:")

print("a) Random Generation:")

arr = [x for x in range(1000)]
random.shuffle(arr)

print("Before Sort:")
print (arr)

print("After Sort:")
start_time = time.time()
heapSort(arr)
time = time.time() - start_time
print(arr)

print("Comparisions")
print(heapSort(arr))
print("Time:")
print(time)

我希望当n = 1000整数时的结果是8421，当n = 10000时是117681，然而，每次当我试图在循环中计数+= 1而不是比较时，它要么显示0要么显示2001。