PERMUTATIONS BY INTERCHANGES
PERMUTATIONS BY INTERCHANGES
复制标题
DOI：
10.1093/comjnl/6.3.293
复制
发表时间：
1963-01-01
期刊：
影响因子：
1.4
通讯作者：
HEAP, BR
中科院分区：
文献类型：
--
作者：
HEAP, BR
讨论了用于获得多个对象的所有可能排列的方法，其中每个排列与其前一个排列的不同之处仅在于两个对象的互换。给出了产生这些排列的两个程序的细节，一个程序允许每个对象以预定顺序填充指定位置，另一个程序需要计算机中的最小存储空间。
Methods for obtaining all possible permutations of a number of objects, in which each permutation differs from its predecessor only by the interchange of two of the objects, are discussed. Details of two programs which produce these permutations are given, one allowing a specified position to be filled by each of the objects in a predetermined order, the other needing the minimum of storage space in a computer.