def quickSort(lst):
if len(lst) <= 1:
return lst
i = 0
while i<len(lst):
if lst[i] > lst[i+1]:
a = lst[i]
lst[i] = lst[i+1]
lst[i+1] = a
i = i+1
return lst
if __name__ == '__main__':
lst = [2, 4, 5, 1, 4]
print(quickSort(lst))
