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 vote178 views1 answer
How to close a webpage using selenium driver python
Python
0 vote199 views1 answer
Matplotlib.pyplot imshow size
Python
4 votes200 views1 answer
7chats_np
Python
0 vote234 views1 answer
What is a good django orm cookbook
Python Django
0 vote180 views2 answers
Online code formatter for pep8
Python
1 vote207 views1 answer
Django text area limit characters
Python
0 vote179 views2 answers
How to delete blank rows from text file in spyder
Python
0 vote174 views1 answer
How to select axis value in python
Python
1 vote222 views1 answer
Browse list python
Python
0 vote163 views1 answer
Pygame.set_volume(2.0) max volume
Python