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

3 votes120 views2 answers
AttributeError: module 'tensorflow' has no attribute 'GraphDef'
Python
1 vote152 views1 answer
Cookies in django
Python Django
0 vote111 views2 answers
A guide to numpy and pandas
Python
5 votes134 views5 answers
Python string format
Python
1 vote136 views2 answers
Python pywhatkit
Python
30 votes127 views5 answers
Generate random float python
Python
0 vote122 views2 answers
Functions in python programming
Python
0 vote120 views1 answer
Untrack local changes
Python
3 votes113 views2 answers
How to delete a turtle in python
Python
6 votes182 views6 answers
Django Redirect
Python Django