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 vote258 views1 answer
Tk inter entry
Python
1 vote221 views1 answer
Prevent list index out of range python
Python
0 vote244 views2 answers
Read_json
Python
-2 votes267 views2 answers
Python eol
Python
68 votes226 views6 answers
Python dict sort by value
Python
0 vote235 views1 answer
Pandas qcut
Python
0 vote189 views1 answer
Python how to hash string into pbkdf2
Python
0 vote231 views1 answer
Opencv export image
Python
2 votes245 views1 answer
Setting a condition for perfect square in python
Python
5 votes292 views3 answers
ImportError: No module named flask
Python Flask