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

142 votes276 views6 answers
Write to file python
Python
3 votes252 views3 answers
Gcd function in python
Python
0 vote256 views1 answer
Factors for negative number python
Python
3 votes259 views2 answers
Tensorflow
Python
2 votes298 views1 answer
Check if user log in flask
Python Flask
1 vote246 views1 answer
Python oprators
Python
1 vote258 views1 answer
AttributeError: 'tensorrt.tensorrt.Builder' object has no attribute 'build_cuda_engine'
Python
1 vote248 views1 answer
Green fuel
Python
3 votes246 views3 answers
Close a file python
Python
0 vote276 views1 answer
Foreignkey as users from a user group django
Python Django