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 vote271 views2 answers
How to get the index of the first integer in a string python
Python
17 votes317 views5 answers
Python add element to array
Python
3 votes302 views2 answers
Python inline print variable
Python
32 votes315 views6 answers
Add to list python
Python
1 vote293 views1 answer
Difference between loc and iloc
Python
0 vote315 views1 answer
Python dictionary key in range
Python
0 vote289 views1 answer
K-means clustering and disabling clusters
Python
20 votes252 views6 answers
Python last item in list
Python
0 vote264 views1 answer
How to use drop for file in python
Python
1 vote308 views1 answer
Python is not writing whole line
Python