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 vote220 views1 answer
Brute force string matching algorithm in python
Python
0 vote184 views1 answer
Automation script for paytm coupon
Python
0 vote183 views1 answer
How to print stdout while processing the execution in python
Python
0 vote188 views1 answer
Named tuple python iterate
Python
0 vote205 views1 answer
Python how to make integer show 2 numbers
Python
0 vote190 views1 answer
Concatenação de Strings
Python
1 vote247 views1 answer
How to add captcha in django forms
Python Django
4 votes179 views2 answers
Python get current user windows
Python
0 vote186 views1 answer
Matplotlib radial averaging
Python
0 vote212 views2 answers
Check anonim user django
Python Django