How to reduce the complexity of the algorithm?

Question

Python

Good evening, please explain I just started learning python, there is a list, it needs to be sorted in ascending order without sort() or sorted(). I made up the code, but its complexity is O(n**2). Is it possible to simplify my algorithm?

a = list(map(int, input().split()))

n = 0
while n < len(a):
    for i in range(1, len(a)):
        if a[i - 1] > a[i]:
            a[i - 1], a[i] = a[i], a[i - 1]
    n += 1
print(a)

Answer 1

Here is a list of sorting algorithms , and each has a difficulty.