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

8 votes117 views1 answer
Tkinter clear entry
Python
0 vote107 views1 answer
Queryset to list python
Python
0 vote119 views1 answer
Turtle python screen border
Python
1 vote106 views1 answer
Polynomial features random forest classifier
Python
0 vote122 views1 answer
Show only lower diagonal in sns pairplot
Python
1 vote131 views1 answer
How to get current CPU and RAM usage in Python?
Python
5 votes114 views2 answers
Change index to dataframe pandas
Python
0 vote133 views1 answer
Send command civil3D
Python
0 vote110 views1 answer
How append a directory based on current directory python
Python
0 vote67 views0 answer
Python