Python Program to Implement CockTail Sorting

def cocktailShakerSorting(data):
    def swap(i, j):
        data[i], data[j] = data[j], data[i]
 
    upper = len(data) - 1
    lower = 0
 
    flag = False
    while (not flag and upper - lower > 1):
        flag = True
        for j in range(lower, upper):
            if data[j + 1] < data[j]:
                swap(j + 1, j)
                flag = False
        upper = upper - 1
 
        for j in range(upper, lower, -1):
            if data[j - 1] > data[j]:
                swap(j - 1, j)
                flag = False
        lower = lower + 1
 
 
list01 = input('Enter the list of numbers: ').split()
list01 = [int(x) for x in list01]

cocktailShakerSorting(list01)

print('nSorted list: ', end='')
print(list01)

Enter the list of numbers: 320 420 140 500 185 60 200 80 10 100
Sorted list: [10, 60, 80, 100, 140, 185, 200, 320, 420, 500]