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 votes196 views1 answer
Django include
Python
23 votes161 views6 answers
Python even or odd
Python
0 vote158 views1 answer
Salir programa python
Python
0 vote235 views1 answer
Default ordering django
Python
0 vote212 views1 answer
Remove grid from 3d plots
Python
1 vote181 views1 answer
Plt line of best fit
Python
0 vote196 views1 answer
Replace NaN value in pandas data frame with zeros
Python
0 vote217 views1 answer
Isidentifier method in python
Python
0 vote233 views1 answer
Setup python in windows tikinter
Python
1 vote162 views2 answers
Python detect internet connection
Python