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

1 vote354 views1 answer
Google colab save faild
Python
6 votes359 views3 answers
Tensorflow install using conda
Python
0 vote337 views1 answer
Post request socket python
Python
0 vote459 views1 answer
Ternary operator using dictionary in Python
Python
0 vote401 views1 answer
Flask decoding base 64 image
Python Flask
16 votes366 views1 answer
Python reimport module after change
Python
5 votes344 views2 answers
Python copy instance
Python
0 vote347 views1 answer
Python get response headers
Python
1 vote371 views1 answer
Python source code
Python
2 votes353 views2 answers
How to replace a single letter in a string python
Python