A simple algorithm of "the problem of shuffle
Min Zhang · Journal of Dalian University · 2003
To a given n-permutation, we can always come back to given n-permutation at fust by replacing, it many times according to a given rule. How to figure number of least replacement of renewing n-permutation? In this paper, we introduce a method which has common meaning and a simple algorithm of the problem of shuffle which completely solves calculate problem of least replacement of renewing n-permutation.