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

4 votes159 views2 answers
How to concat on the basis of particular columns in pandas
Python
7 votes150 views1 answer
Emoji In Python
Python
20 votes217 views3 answers
Matplotlib custom legend
Python
36 votes195 views6 answers
Reset_index pandas
Python
9 votes179 views3 answers
Numpy euclidean distance
Python
0 vote245 views1 answer
R value on poly fit python
Python
1 vote146 views1 answer
Get the system boot time in python
Python
23 votes156 views6 answers
Odd or even python
Python
0 vote149 views1 answer
Df.head() in python
Python
0 vote142 views1 answer
Django generate openapi schema command line
Python