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 vote376 views2 answers
Load data python
Python
25 votes318 views6 answers
Create new python environment
Python
0 vote395 views1 answer
Python NameError: name 'io' is not defined
Python
10 votes377 views2 answers
Python create file if not exists
Python
2 votes346 views1 answer
Make first row columns pandas
Python
44 votes309 views3 answers
Find sum numbers in a list in python
Python
0 vote324 views1 answer
Keras backend matrix multiplication
Python
2 votes323 views2 answers
Panda - subset based on column value
Python
0 vote301 views1 answer
How to plot 2 decimal values in axis python
Python
0 vote373 views1 answer
XML to MS SQL
Python