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

5 votes94 views1 answer
Python matplt
Python
2 votes106 views1 answer
Tkinter how to remove button boder
Python
0 vote107 views1 answer
Finding Maximum Elements along columns using Python numpy.argmax()
Python
0 vote70 views1 answer
Calendly python
Python
0 vote98 views1 answer
Python - How To Check if a String Contains Word
Python
3 votes205 views5 answers
India
Python
0 vote97 views1 answer
Pretty print list python
Python
0 vote97 views1 answer
How to add badges to github repo
Python
0 vote117 views2 answers
Pyton como identificar se é numero
Python
0 vote96 views1 answer
Import cmath python 3
Python