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 vote167 views2 answers
Py search and get objects from array
Python
0 vote159 views1 answer
Python immutable dataclass
Python
0 vote183 views3 answers
Best python programs
Python
39 votes174 views2 answers
Create text in python if not exists
Python
0 vote213 views1 answer
Check correlation of each column with the target in python
Python
0 vote202 views1 answer
Rename a variable using .format in python
Python
0 vote168 views1 answer
Get py version
Python
1 vote187 views2 answers
All column except pandas
Python
0 vote179 views1 answer
Tkinter gui grid and frame
Python
0 vote194 views1 answer
Python pass string with spaces as argument
Python