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 vote143 views1 answer
Scaling Operation in SkLearn
Python
14 votes175 views4 answers
Django delete
Python Django
0 vote175 views1 answer
How to initialize pygame
Python
1 vote146 views1 answer
Tensorflow keras lambda function
Python
4 votes142 views1 answer
Python make comparison non case sensitive
Python
-1 vote144 views1 answer
Python get the last in dictionary
Python
8 votes143 views3 answers
Join dataframe pandas by column
Python
4 votes141 views3 answers
Write a list into csv python
Python
1 vote143 views1 answer
How to remove every other letter from a string python
Python
0 vote174 views1 answer
Find pdf encrypted password with python
Python