Отсортировать по возрастанию

from heapq import heapify
 
n = int(input())
*a, = map(int, input().split())
heapify(a)
print(*a)

def bubble_sort(people):
    n = len(people)
    for i in range(n):
        for j in range(n - i - 1):
            already_sorted = True
            if people[j] > people[j + 1]:
                people[j], people[j + 1] = people[j + 1], people[j]
                already_sorted = False
        if already_sorted:
            break
    return people
 
number = int(input())
people = list(map(int, input().split()))
print(bubble_sort(people))

def bubble_sort(people):
    n = len(people)
    for i in range(n):
        for j in range(n - i - 1):

def bubble_sort(people):
    for i in range(number):
        for j in range(number - i - 1):
             #............
number = int(input())
people = list(map(int, input().split()))

number = int(input())
people = list(map(int, input().split()))
 
for i in range(number-1):
    for j in range(number-i-1):
        if people[j] > people[j+1]:
            people[j], people[j+1] = people[j+1], people[j]

def bubble_sort(arr):
    k=1
    while True:
        c=0
        for i in range(len(arr)-k):
            if arr[i]>arr[i+1]:
                arr[i],arr[i+1]=arr[i+1],arr[i]
                c+=1
        if c==0:
            break
        k+=1