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 votes123 views2 answers
Which is best between c and python for making application
Python
0 vote109 views1 answer
1: for python position
Python
6 votes110 views5 answers
Mean python
Python
0 vote110 views1 answer
Plot every nth label in barplot
Python
0 vote131 views1 answer
Python selenium set attribute of element
Python
0 vote271 views1 answer
Change form type flask from text to selection flask admin
Python
0 vote105 views1 answer
If keyboard.is_pressed
Python
0 vote116 views1 answer
Python logger exception
Python
7 votes64 views1 answer
How to check if an application is open in python
Python
0 vote125 views1 answer
Cv2.imshow not working in vscode
Python