(n,(n-1)!)——拉丁阵的随机生成

A Random Methed for Generating (n,(n-1)!) —Latin Array

本文介绍了全部ｎ阶置换的生成算法和由任一序号ｍ（０≤ｍ≤｜Ｓｎ｜－１）求出与（ｎ，（ｎ－１）！）—拉丁阵中序号相同的列的算法；并利用拉丁阵的组合性质和以上两个算法随机生成了一个（ｎ，（ｎ－１）！）—拉丁阵。

In this paper,an algorithm which generates all of the permutations of order n is introduced.Furthermore,an algorothm to find the mth permutation for any m which corresponds to the order of (n,(n-1)!)—Latin array is presented.Taking the advantages of the combinatorial property and the two algorithms above,one can generate an (n,(n-1)!)-latin array at random.