Thank you, i will try out your method, it seems pretty clear.
After i try that out i would like to check that other more efficient method you were talking about where you only need N - 1 swapping operations. Do you know where i can read more about that other method or the name of it?
Thanks again.
Thanks for your reply, I'm going to read about that.
I'm trying to find out the permutations needed to do mathematically for any N number group, knowing only the original and the final state.
Ideally something of the format: O1i . O2j . C12 = Cij
But for a N number group instead of just a this...
I have a question that is a little hard to explain, since i don't know the name of this method, but I'll try my best, if anyone knows the name please do tell me.
So let's say we have three numbers, 1 2 3 (in this order)
and we have a container for this numbers: C123
and we have some...