1738: 排序 -希尔排序

注意输入输出

# 希尔排序
def shell_sort(nums):
    # 间隙初始为数组长度的一半
    gap = len(nums) // 2
    # 当间隙大于0时继续排序
    while gap > 0:
        # 开始插入排序
        for i in range(0, len(nums), gap):
            # 拿出待排序元素
            tem = nums[i]
            # 找到合适的位置
            j = i - gap
            while j >= 0 and nums[j] > tem:
                # 往右边移
                nums[j + gap] = nums[j]
                j -= gap
            # 在合适的位置插入元素
            nums[j + gap] = tem
        # 缩小gap
        gap //= 2
while True:
    try:
        n = eval(input())
        nums = list(map(eval, input().split()))
        shell_sort(nums)
        for j in range(n):
            if j != n - 1:
                print(nums[j], end=" ")
            else:
                print(nums[j])
    except Exception:
        break