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 vote188 views1 answer
How to add phone number to django user model
Python
0 vote180 views1 answer
Remove words from set if in list python site:stackoverflow.com
Python
-1 vote186 views2 answers
From html to jupyter notebook
Python
1 vote194 views1 answer
Django login redirect
Python Django
0 vote180 views1 answer
Def areEquallyStrong(yourLeft, yourRight, friendsLeft, friendsRight):python execution
Python
2 votes189 views1 answer
Python unchain list
Python
0 vote228 views1 answer
Como filtrar los vacios, NaN, null en python
Python
0 vote236 views1 answer
How to display printed values without scientific notation python
Python
0 vote165 views1 answer
ValueError: unknown is not supported in sklearn.RFECV
Python
1 vote202 views1 answer
Proper tree in data structure
Python