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

2 votes193 views2 answers
Split datetime to date and time pandas
Python
27 votes185 views3 answers
Splitting a string and appending each character to a list python
Python
0 vote230 views1 answer
Csgo force crosshair on sniper python
Python
7 votes193 views2 answers
How to execute python script in another script
Python
2 votes195 views1 answer
Python download s3 image
Python
1 vote231 views1 answer
Upload image to s3 python
Python
0 vote186 views1 answer
\xa python
Python
2 votes178 views2 answers
Check string similarity python
Python
34 votes209 views6 answers
Dataframe from dict
Python
0 vote203 views1 answer
How to read first column of csv intro a list python
Python