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

21 votes124 views3 answers
Python convert string to float
Python
1 vote136 views1 answer
Python cffi install
Python
0 vote130 views1 answer
How to convert each string to a category or int in python dataframe
Python
0 vote160 views1 answer
Current page django
Python Django
0 vote133 views1 answer
Unsupervised knn
Python
1 vote132 views5 answers
Transpose a matrix in python
Python
0 vote138 views1 answer
No lapack/blas resources found scipy
Python
7 votes149 views2 answers
Pandas change to numeric
Python
1 vote151 views1 answer
Pandas new column from others
Python
0 vote121 views1 answer
Kivy video recorder
Python