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 vote138 views1 answer
How to pause a thread in python
Python
0 vote151 views1 answer
From plyfile import PlyData ModuleNotFoundError: No module named 'plyfile'
Python
13 votes175 views2 answers
How to know how much lines a file has using python
Python
0 vote131 views1 answer
Unpack a sequence into variables python
Python
31 votes119 views6 answers
Count unique pandas
Python
0 vote124 views1 answer
Sort rows in csv file using python pandas
Python
0 vote142 views1 answer
Tick size colorbar python
Python
0 vote166 views1 answer
Backend not found Request Method: GET Request URL: http://127.0.0.1:8000/oauth/login/google-oauth2/ Raised by: social_django.views.au
Python Django
0 vote131 views1 answer
Matrix outer product python
Python
0 vote131 views1 answer
Mechanize python LE #3
Python