关于“洗牌问题”的一种简便算法

A simple algorithm of "the problem of shuffle

对于给定的一个n元排列,按照某一指定的排列规则(即置换)累次对其进行置换(重排),总可以使之还原成原来的排列。 关于如何计算n元排列还原的最少置换次数,本文首先介绍一种具有普遍意义的一般计算方法,然后针对“洗牌问题”给出计算n元排列还原的最少置换次数的另一种简便方法,从而解决了n元排列还原最少置换次数的计算问题。

To a given n-permutation, we can always come back to the given n-permutation at fust by replacing, it many times according to a given rule. How to figure the 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 the calculate problem of the least replacement of renewing n-permutation.