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

6 votes188 views2 answers
How to use colorama
Python
0 vote193 views1 answer
Documentation on fasttext gensim python
Python
4 votes178 views1 answer
Python -c import pty;
Python
1 vote309 views3 answers
Exponential python
Python
12 votes266 views6 answers
Python progress bar
Python
0 vote170 views1 answer
Python edit global variable in function
Python
40 votes184 views2 answers
Sorting values in dictionary in python
Python
0 vote179 views2 answers
Palindrom python rekursiv
Python
0 vote287 views2 answers
Install python in centos7
Python
4 votes182 views1 answer
How to cnovert a decimal to fraction python
Python