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

6 votes314 views5 answers
Mean python
Python
2 votes318 views3 answers
Nltk pip
Python
4 votes337 views2 answers
Tty escape
Python
1 vote325 views1 answer
Python how to say hello world
Python
0 vote345 views1 answer
Logging store info to different files
Python
1 vote348 views1 answer
Torch save state dict
Python
15 votes331 views6 answers
How to get confusion matrix in python
Python
0 vote350 views1 answer
Obspy stats
Python
3 votes347 views3 answers
Take pictures from webcam python
Python
0 vote321 views1 answer
Flask Upload file to local s3
Python