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

0 vote123 views1 answer
MIn-Max problem in python
Python
0 vote130 views1 answer
How draw shell in python
Python
0 vote132 views1 answer
How to make one list from nested list
Python
0 vote186 views1 answer
Substring in a django template?
Python Django
2 votes136 views1 answer
Pandas convert string from INT TO str
Python
0 vote129 views2 answers
Converting binary to octal in python
Python
-4 votes127 views4 answers
Django latest version
Python
0 vote126 views1 answer
Python quick tutorial
Python
0 vote131 views2 answers
Call for a last number in series python
Python
6 votes152 views2 answers
How to change background of tkinter window
Python