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

58 votes262 views6 answers
String list to int list python
Python
1 vote255 views2 answers
Python convert multidimensional array to one dimensional
Python
1 vote261 views1 answer
Sleep 5 seconds py
Python
-1 vote288 views1 answer
Django filter on related field
Python Django
5 votes261 views1 answer
Python generate id
Python
6 votes239 views1 answer
Django model form
Python
5 votes244 views3 answers
Python add
Python
0 vote231 views9 answers
Convert c++ to python online
Python
0 vote287 views1 answer
Sklearn import tree
Python
11 votes277 views3 answers
Dataframe delete row
Python