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 vote160 views1 answer
Recursive class method python
Python
35 votes160 views2 answers
Pwd python
Python
1 vote210 views1 answer
How to add char to string python
Python
11 votes168 views2 answers
__str__()
Python
3 votes171 views3 answers
Python post request
Python
0 vote152 views1 answer
Mode with group by in python
Python
1 vote167 views1 answer
How to add to hashmap python
Python
1 vote164 views1 answer
How shorten with enter long script python
Python
0 vote155 views1 answer
Pandas dataframe unique multiple columns
Python
0 vote157 views1 answer
Add authorization header in python requests
Python