Shuffle an array as many as possible

Question

I have an array like this

[0,2,3]

The possible shuffling of this array are

[0,2,3], [2,3,0], [3,0,2], [3,2,0], [0,3,2],         


        

Answer 1

Try a recursive approach. Here's a hint: every permutation of [0,2,3] is either

• [0] plus a permutation of [2,3] or
• [2] plus a permutation of [0,3] or
• [3] plus a permutation of [0,2]