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

1 vote289 views1 answer
Python in line conditional statement
Python
0 vote328 views1 answer
Record audio with processing python
Python
4 votes309 views1 answer
Fixed precision float python
Python
18 votes305 views3 answers
Regex findall
Python
5 votes292 views3 answers
Object to int64 pandas
Python
0 vote298 views1 answer
Access django server from another machine
Python
4 votes323 views3 answers
Python create 2d array deep copy
Python
1 vote298 views2 answers
Speech enhancement techniques
Python
2 votes332 views2 answers
Python selenium full screen
Python
2 votes323 views1 answer
Python keep value recursive function
Python