Linear Sort in DSA Python

Program 1

#Program for Linear sort
import os
os.system('cls')
mylist=[]
n=int(input("Enter the limit"))
print("Enter elements")
for i in range(n):
    x=int(input())
    mylist.append(x)

# for i in range(0,n):
#     for j in range(i+1,n):
#         if(mylist[j]<mylist[i]):
#              mylist[i],mylist[j]=mylist[j],mylist[i]

# # i=0
# while(i<n):
#     j=i+1
#     while(j<n):
#         if(mylist[j]<mylist[i]):
#             mylist[i],mylist[j]=mylist[j],mylist[i]
#         j=j+1
#     i=i+1            

print("Sorted elements: ")
for i in range(n):
    print(mylist[i])