Hello,<br>↵
I had a problem: make sequence of random permutations which elements do not occur in same positions.↵
E.g. I have list ('a', 'b', 'c', 'd'). I randomly generate permutation, say 'a d b c', then next permutation, say 'd cb a'a b, then next permutation can not start with 'a' and 'd', because these elements occurs in first or second sequence on same position.<br>↵
My algorithm is slow: I repeat to generate random (with [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle)) permutation and check each element if it not occur in previous sequences (I used 2D array). How to determine what is the complexity of my algorithm? <br>↵
How to solve problem faster?
I had a problem: make sequence of random permutations which elements do not occur in same positions.↵
E.g. I have list ('a', 'b', 'c', 'd'). I randomly generate permutation, say 'a d b c', then next permutation, say 'd c
My algorithm is slow: I repeat to generate random (with [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle)) permutation and check each element if it not occur in previous sequences (I used 2D array). How to determine what is the complexity of my algorithm? <br>↵
How to solve problem faster?
