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 vote213 views1 answer
Python How To Check Operating System
Python
0 vote197 views1 answer
Pandas change to first day
Python
0 vote221 views1 answer
How to set pywal permenent
Python
34 votes200 views3 answers
Download dataframe as csv
Python
1 vote196 views2 answers
Access element of dataframe python
Python
3 votes220 views2 answers
Unix to date python
Python
0 vote197 views2 answers
Ocr image table to excel python
Python
0 vote191 views1 answer
Filter startswith django
Python
16 votes251 views4 answers
Mean of a list python
Python
0 vote150 views1 answer
Can only concatenate str (not "numpy.uint8") to str
Python