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

0 vote192 views1 answer
Mad libs generator python tutorial
Python
0 vote204 views1 answer
Violin Plots, Python
Python
22 votes181 views6 answers
How to install pygame in python
Python
0 vote196 views1 answer
Django user refistration
Python
34 votes196 views6 answers
How to make an array in python
Python
0 vote236 views1 answer
Pass query params django template
Python Django
14 votes249 views4 answers
Reset index
Python
0 vote213 views1 answer
Python tabulate print only one row
Python
54 votes251 views6 answers
Conda create environment python 3.6
Python
2 votes193 views1 answer
Set axis title matplotlib
Python