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

60 votes192 views4 answers
Python choose random sample from list
Python
78 votes197 views6 answers
Python string reverse
Python
204 votes358 views6 answers
Random python
Python
2 votes184 views5 answers
Download python 3.6 64 bit for windows 7
Python
12 votes194 views3 answers
How to delete last N columns of dataframe
Python
0 vote219 views1 answer
Python django model range validation
Python
0 vote184 views1 answer
Encoding int to chr in python and vice versa
Python
0 vote204 views1 answer
Django cms api create page
Python
0 vote147 views1 answer
Pickle.load from gpu device to cpu
Python
0 vote260 views1 answer
Get nonzero min numpy
Python