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

33 votes206 views4 answers
Data frame
Python
1 vote239 views1 answer
Indentation levels in programming
Python
1 vote196 views1 answer
How to convert ton to kg using python
Python
1 vote204 views1 answer
Inplace pandas
Python
0 vote227 views1 answer
Django rest framework not getting form
Python Django
0 vote201 views1 answer
Colorbar remove tick lines and border
Python
0 vote191 views1 answer
Get fields in object python
Python
-1 vote196 views1 answer
How to transcode a video in python using ffmpeg
Python
1 vote202 views2 answers
Python strptime milliseconds
Python
5 votes220 views2 answers
Python pie chart
Python