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 vote228 views1 answer
Stackoverflow: install old version of networkx
Python
5 votes232 views6 answers
Python speech to text
Python
0 vote202 views1 answer
Split at the second occurrence of the element python
Python
0 vote230 views1 answer
Numpy.ndarray to lsit
Python
0 vote210 views1 answer
Scrfoll with selenium python
Python
1 vote206 views2 answers
Create requirements.txt conda
Python
3 votes233 views4 answers
Python list append
Python
0 vote206 views1 answer
How to connect wifi using python
Python
2 votes209 views2 answers
Iterate through attributes of class python
Python
0 vote263 views1 answer
Membuat chat bot dengan python
Python