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 vote335 views1 answer
How to cerate a bar chart seaborn
Python
0 vote324 views1 answer
Django db_index=true
Python Django
0 vote334 views1 answer
Created by and updated by in django
Python
0 vote430 views2 answers
Make entry bigger in tkinter python
Python
0 vote374 views1 answer
Bad resolution with df plot
Python
0 vote335 views1 answer
Edit models in django admin
Python Django
28 votes468 views1 answer
Import "matplotlib" could not be resolved django
Python Django
0 vote346 views2 answers
Qq plot using seaborn with regression line
Python
0 vote452 views1 answer
Flask request file push request(uploadedfile= request.file) uploadedfile.read()
Python
2 votes303 views1 answer
Selenium zoom out python
Python