def run():
a = pythm.get_list(16, 20)
print(a)
# d = []
bsort(a, 21)
print(a)
print(pythm.chaos_list)
def py_heap():
arr = pythm.get_list(10, 20)
print(arr)
hp = list(arr)
heapq.heapify(hp)
print(hp)
d = []
for i in range(len(arr)):
d[i] = heapq.heappop(hp)
print(d)
def run():
# arr = [1, 4, 0, 0, 7, 2, 1, 3, 2, 1, 4, 2, 3, 2, 1]
# arr = [1, 4, 7, 3, 2, 1]
arr = pythm.get_list(10, 30)
# print(counting_sort(arr, max(arr)))
print(arr)
# arr = bsort(arr)
# print(arr)
import heapq
print(arr)
hp = list(arr)
heapq.heapify(hp)
print(hp)
def run():
arr = pythm.get_list(11, 20)
# arr = [18, 15, 4, 2, 9, 7, 16, 6, 11, 31]
print(arr)
bsort(arr)
print(arr)
def run():
arr = pythm.get_list(10, 20)
print(arr)
arr = qsort(arr)
print(arr)