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 vote136 views1 answer
Flask python use specified port
Python Flask
6 votes104 views2 answers
Sys.executable
Python
0 vote119 views1 answer
Detect operating system using python
Python
0 vote112 views1 answer
Python find equal rows of two numpy arrays
Python
0 vote70 views1 answer
Replace all string in list python
Python
1 vote103 views1 answer
Python how to sort by date
Python
0 vote110 views1 answer
Seaborn countplot hue stacked
Python
2 votes104 views1 answer
Dict typing python
Python
0 vote103 views1 answer
Python call function x number of times
Python
0 vote112 views1 answer
Web3.py failing not installing
Python