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 vote318 views1 answer
How to create a graphical user interface in python
Python
1 vote309 views2 answers
Django template iterate dict
Python
31 votes313 views4 answers
Convert excel to csv python program
Python
12 votes306 views4 answers
Python remove
Python
0 vote407 views1 answer
Using a generic exception block
Python
3 votes358 views3 answers
Python get script path
Python
-1 vote268 views1 answer
How to make a python library
Python
0 vote380 views2 answers
How to get username discord ext python
Python
0 vote339 views1 answer
Raise keyerror(key) from none os.environ
Python
0 vote342 views1 answer
Django model custom field
Python Django