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

4 votes213 views2 answers
How to remove all elements from dictionary python
Python
0 vote261 views1 answer
Run all python files in a directory in windows
Python
0 vote269 views1 answer
Python write to file permission denied
Python
-1 vote260 views4 answers
Python creare decoratori
Python
22 votes273 views4 answers
Python is float
Python
1 vote233 views1 answer
Pandas return index
Python
2 votes245 views4 answers
Update link python is python 3
Python
2 votes330 views1 answer
Django try catch exception
Python
1 vote256 views1 answer
Python filter list of int and strings
Python
0 vote267 views1 answer
Assert var == 0
Python