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

2 votes347 views1 answer
Python write a list to a file line by line
Python
0 vote354 views1 answer
Access kwargs in template django
Python
0 vote324 views1 answer
Odoo site map for employees hierarchy
Python
13 votes362 views2 answers
Wap to print factorial of a number using function in python
Python
0 vote324 views1 answer
Pip install for python 2 and python3
Python
2 votes330 views2 answers
Python primera letra mayuscula
Python
0 vote353 views1 answer
Print subscript and superscript python
Python
0 vote284 views1 answer
Savefig image size
Python
2 votes326 views1 answer
How to insert a variable into a string without breaking up the string in python
Python
1 vote416 views1 answer
Get sheet names using pandas
Python