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 vote164 views1 answer
Python calling method from constructor
Python
0 vote152 views1 answer
Python function guts
Python
2 votes159 views1 answer
Convert opencv image to pil image
Python
31 votes147 views6 answers
Strip whitespace python
Python
1 vote165 views1 answer
Pytho narrondir un nombre
Python
0 vote131 views1 answer
Auto instagram login
Python
6 votes148 views1 answer
Angle names matplotlib
Python
89 votes151 views6 answers
Import csv file in python
Python
0 vote111 views1 answer
Django time cualtulate
Python
0 vote143 views1 answer
Not to display column tree odoo 8
Python