Python permutation using recursion

Question

I want to generate permutations of the list while considering the following constraint:

• Every permutation starts with a number 0

Thus, I have a list li = [1,2,3,4], and I am interested in finding all unique permutations for those 4 numbers while adding a number 0 at index 0 to each permutation.

For example:

[0,1,2,3,4]

[0,1,3,2,4]

and so on.

Answer 1

Kindly use the below code:

def create_perm(actual_list, add_list):

    """

    Recursive function for the creation of the permutation

    """

    if len(add_list)==1:

        # If you reach the last item, print the found permutation

        # (add the 0 at the beginning)

        print([0] + actual_list + add_list)

    else:

        for i in add_list:

            # Go one step deeper by removing one item and add it to the found permutation

            new_add_list = add_list.copy()

            new_add_list.remove(i)

            # Make the recursion

            create_perm(actual_list + [i], new_add_list)

    

li = [1, 2, 3, 4]

create_perm([], li)

Want to gain skills in Data Science with Python? Sign up today for this Data Science with Python Course and be a master in it