Python实现鸡尾酒排序算法

def cocktail_sort(arr):
    left, right = 0, len(arr) - 1
    while left < right:
        for i in range(left, right):  # 从左到右扫描并把最大的数移到右边
            if arr[i] > arr[i + 1]:
                arr[i], arr[i + 1] = arr[i + 1], arr[i]
        right -= 1
        for i in range(right, left, -1):  # 从右到左扫描并把最小的数移到左边
            if arr[i] < arr[i - 1]:
                arr[i], arr[i - 1] = arr[i - 1], arr[i]
        left += 1
    return arr

print(cocktail_sort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]))  # [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
print(cocktail_sort([5, 4, 3, 2, 1]))  # [1, 2, 3, 4, 5]
print(cocktail_sort([1, 2, 3, 4, 5]))  # [1, 2, 3, 4, 5]
print(cocktail_sort(["p", "i", "d", "a", "n", "c", "o", "d", "e", ".", "c", "o", "m"]))  # [".", "c", "c", "d", "d", "e", "e", "i", "m", "n", "o", "o", "p"]
print(cocktail_sort(["皮", "蛋", "编", "程", "是", "一", "个", "好", "网", "站"]))  # ["一", "个", "编", "程", "好", "是", "网", "站", "蛋", "皮"]