def full_sort(seq: list):
    '''
    author: 淺若清風cyf
    date: 2022/03/17
    全排列算法（遞歸）
    :param seq: 原始序列
    :return:
    '''
    results = []
    if len(seq) == 1:
        return seq
    elif len(seq) == 2:  # 遞歸返回終點
        return [[seq[0], seq[1]], [seq[1], seq[0]]]
    else:
        for i in seq:
            sub_seq = seq.copy()  # list類型為引用傳遞，此處需要使用copy()創建一個副本，避免修改原始list
            sub_seq.remove(i)
            tmp_result = full_sort(sub_seq)  # 獲取子列表的全排列
            for t in tmp_result:
                results.append([i] + t)
        return results

if __name__ == '__main__':
    res = full_sort([1, 2, 3, 4])
    n = 0
    for i in res:
        print(i, end=' ')
        n += 1
        if n % 5 == 0:
            n = n % 5
            print('')

    res = full_sort(['Apple', 'XiaoMi', 'HuaWei', 'OPPO'])
    n = 0
    for i in res:
        print(i, end=' ')
        n += 1
        if n % 5 == 0:
            n = n % 5
            print('')