冒泡排序优化

def solve():
    lst = [____, ____, ____, ____, ____]
    n = len(____)
    for i in range(____):
        swapped = False
        for j in range(____, n - i - ____):
            if lst[j] > lst[j + ____]:
                lst[j], lst[j + ____] = lst[j + ____], lst[j]
                swapped = True
        if not swapped:
            break
    print(____)