How to store all distinct permutations in a list from a recursive function?

Question

I want to create a recursive function, that either generates distinct permutatins, or stores and returns them and in a list.

I have found this code on https://www.gee