摘要
错排数在排列计数中有非常重要的作用,对于错排数的研究通常是利用递推关系。本文讨论一个更高效的错排数的输出算法。
Wrong permutation number is very important in permutation statistics. Some studies on it were generally made by recursive relation algorithm. In this paper, a more efficient algorithm is given.
出处
《电脑与电信》
2008年第4期36-37,共2页
Computer & Telecommunication
