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 vote138 views1 answer
Import pygame module in pycharm
Python
0 vote160 views1 answer
Python format() function uses.
Python
0 vote140 views2 answers
How to make a gui with kivy
Python
-2 votes134 views3 answers
How to make turtle shape image smaller
Python
1 vote239 views1 answer
Python - Comment chiffrer une boucle
Python
13 votes147 views1 answer
Configure funCtion in tkinter
Python
16 votes137 views3 answers
Python get all file names in a dir
Python
6 votes150 views2 answers
Python square a number
Python
1 vote140 views1 answer
Django update increment
Python
1 vote136 views1 answer
Python dynamic object
Python