A new algorithm for generating derangements
A new algorithm for generating derangements
复制标题
一种产生混乱的新算法
作者：
S. Akl
本文提出并分析了一种基于已知排列生成方法的新的排列生成算法。该算法被证明是上级的存储和时间要求现有的方法。
A new algorithm for generating derangements based on a well known permutation generation method is presented and analysed. The algorithm is shown to be superior in storage and time requirements to the existing method.