Selection Sort in python

Time Complexity:O(n*n)
a=[5,4,3,2,1]

for i in range(0,4):
    x=i
    for j in range(i+1,5):
       
        if (a[x]>a[j]):
            x=j
           
    temp=a[i]
    a[i]=a[x]
    a[x]=temp

           
       
print(a)