Heapsort python

def buildHeap(lista, n):
    for i in range(n//2 - 1, -1, -1):
        heapify(lista, n, i)

def heapify(lista, n, i):
    largest = i  
    left = (2 * i) + 1    
    right = (2 * i) + 2 

    if left < n and lista[largest] < lista[left]:
        largest = left

    if right < n and lista[largest] < lista[right]:
        largest = right

    if largest != i:
        lista[i], lista[largest] = lista[largest], lista[i] 
        heapify(lista, n, largest) 

def heapSort(lista):
    n = len(lista)
    buildHeap(lista, n)
    
    for i in range(n-1, 0, -1):
        lista[i], lista[0] = lista[0], lista[i]
        heapify(lista, i, 0)

Similar codes

1 vote154 views1 answer
How to find python location in cmd
Python
0 vote162 views1 answer
How to make an ai
Python
10 votes147 views4 answers
Confusion matrix with labels sklearn
Python
-3 votes115 views2 answers
Detect text in image opencv
Python
0 vote213 views1 answer
Def plot_null_matrix(df, figsize=(18,15)): # initiate the figure plt.figure(figsize=figsize) # create a boolean dataframe based on whether values are
Python
1 vote150 views2 answers
Iterable object pytohn
Python
13 votes152 views5 answers
Pandas replace values in column based on condition
Python
0 vote167 views1 answer
Load url in jupyterlab
Python
7 votes200 views3 answers
Update django
Python Django
2 votes185 views1 answer
Make a script run itself again python
Python