Permutations of ordered set where only one object changes its position.

Is there a quick way to get all possible permutations where we put one object at all position, while keeping the order of all other objects?

As an examle, consider {A,B,C}.

1. Change position of A: ABC, BAC, BCA
2. Change position of B: ACB [BAC, ABC both done in 1.]
3. Change position of C: CAB [ACB, ABC, done in 1. and 2.]

Answer 1

[David Goodmanson]

Hi Michael,

no there is not. CBA is a permutation, and it cannot be made to fit the pattern.