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

0 vote194 views1 answer
Gridlayout pyqt5 python using a for loop
Python
0 vote175 views1 answer
Ignore pytest errors or warnings
Python
19 votes209 views6 answers
For loop
Python
0 vote194 views1 answer
Unity python
Python
3 votes195 views1 answer
Sqlalchemy one to many
Python
2 votes187 views1 answer
Open tiff image pyt
Python
0 vote171 views1 answer
Where to import kivy builder
Python
19 votes184 views5 answers
Python floor
Python
0 vote196 views1 answer
Run git pull from python script
Python
0 vote178 views1 answer
Ladnha;
Python