Question

Write a python function that returns a list or array of tuples containing every permutation of numbers 1 to n. For example:

permutate(1): [(1,)]

permutate(2): [(1, 2), (2, 1)]

permutate(3): [(1, 2, 3), (1, 3, 2), (3, 1, 2), (3, 2, 1), (2, 3, 1), (2, 1, 3)]

#here is some starting code

def permutate(n):

result = []

return result

Answer 1

SOURCE CODE:

*Please follow the comments to better understand the code.

**Please look at the Screenshot below and use this code to copy-paste.

***The code in the below screenshot is neatly indented for better understanding.

# permutations of numbers 1 to n
def permutate(n):
    result = []
    numbers = list(range(1, n + 1))
    # take an list of lists empty
    answer = [[]]
    # Loop through the numbers
    for x in numbers:
        perm = []
        for p in answer:
            for i in range(len(p) + 1):
                # append that permutation to the list
                perm.append(p[:i] + [x] + p[i:])
                answer = perm
    # convert it to tuples
    for l in answer:
        result.append(tuple(l))

    # return the tuples in the order needed
    return  list(reversed(result[len(result) // 2:])) + result[:len(result) // 2]


print(permutate(1))
print(permutate(2))
print(permutate(3))

-=============

SCREENSHOT: