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 vote217 views2 answers
Pywhatkit.text to handwriting(text,rgb=[0,0,0])
Python
0 vote191 views1 answer
Take screenshot of video python
Python
0 vote204 views3 answers
Rename key in dict python
Python
4 votes227 views2 answers
Random matrix python
Python
0 vote187 views1 answer
Drf serializer general validate method
Python
0 vote261 views1 answer
C="He is {} and he is {}".format(a,b) python
Python
0 vote222 views1 answer
In python how to end the code after 10 input
Python
0 vote194 views1 answer
Python no mathcing key method found
Python
0 vote192 views1 answer
Set application taskbar icon
Python
7 votes258 views1 answer
Jupyter install user environment
Python