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

1 vote257 views1 answer
How to sort by length python
Python
0 vote263 views1 answer
1 12 123 python
Python
2 votes279 views2 answers
How to get the amount of nan values in a data fram
Python
0 vote254 views1 answer
Check prime number in python
Python
0 vote280 views1 answer
Blender 2.8 python set active object
Python
0 vote318 views1 answer
Django python base 64 decode
Python
85 votes257 views6 answers
How to activate virtual environment in python
Python
0 vote308 views1 answer
Customise the django rest api view
Python Django
0 vote259 views1 answer
Dinoscape für pc
Python
0 vote283 views1 answer
Jinja 2 iterate over dictionary
Python