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

109 votes290 views6 answers
Python string contains substring
Python
0 vote281 views3 answers
Missing Data Plotly Express px.data
Python
29 votes413 views5 answers
Static dirs django
Python Django
0 vote283 views1 answer
Django is .get lazy
Python Django
1 vote288 views5 answers
Delete csr python
Python
0 vote319 views1 answer
Production mode flask
Python Flask
0 vote280 views1 answer
No module named 'pygame' visual studio
Python
0 vote253 views5 answers
Space weather dashboard build your own custom dashboard to analyze and predict weather
Python
3 votes294 views2 answers
How to add list numbers in python
Python
0 vote290 views1 answer
Cross_val_score scoring parameters types
Python