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 vote281 views1 answer
How to type shashank in python
Python
83 votes274 views3 answers
Deleting a file using python
Python
12 votes277 views2 answers
How to execute a python file from another python file
Python
0 vote325 views1 answer
Python cassandra
Python
0 vote277 views1 answer
Radians in python turtle
Python
0 vote278 views1 answer
Python scapy install window
Python
0 vote305 views1 answer
How to change defaul tpython version\
Python
6 votes269 views3 answers
Extract frames from video python
Python
-1 vote289 views1 answer
Python convert integer to signed base 2 complement
Python
0 vote297 views1 answer
Print the multiple data types in a single program in list data structures
Python