多重集的全排列算法研究毕业论文2.doc

本科毕业论文 (科研训练、毕业设计) 题 目：多重集的全排列算法研究 姓 名： 学 院：软件学院 系：软件工程系 专 业：软件工程 年 级： 学 号： 指导教师（校内）： 职称： 年（Multise）（TWDRI）TWDRI算法适用于各种不同字符的输入情况，具有广泛的通用性。在此，我们进行了大量的模拟，测试了从10位到17位的输入情况，并与11种世界上已知的最快或最新的算法[1][2][3][4][5][6][7][8][9][10]进行详细的比较。模拟比较结果证明，本文提出的算法表现出相当优秀的时间和空间性能：在处理多重集问题上，速度是现存已知算法的3倍，内存开销也仅仅在800K以下。同时，本文也首次提出一种科学的计算方法，用于评估随机输入N位长度的多重集排列产生的平均时间，具有历史创新性。 [关键词] 多重集 排列 算法 A Research into Multiset Permutation Algorithm [Abstract] We introduce TWDRI algorithm, the fastest new permutation technique for multiset permutations. A multiset is a set for which repeated elements are considered. The multiset permutation is a mathematical model. We consider any character string of length N as a multiset, which has k different characters, each has count n0, n1, … , nk-1, respectively. Clearly, N = n0 + n1 +…+ nk-1. For the input string, the multiset permutation generates all possible permutations without redundancy. When N=k, it is a pure permutation since n0 = n1 =…= nk-1 = 1. In general, we randomly input a character string with length N to generate its multiset permutation. We evaluate our permutation time and memory consumption by simulating strings with length N = 10, 11, 12, 13, 14, 15, 16, and 17, respectively. We calculate average multiset permutation time for all possible N N inputs with each fixed length N above. We compare our results with the eleven fastest known and/or well-known algorithms[1][2][3][4][5][6][7][8][9][10] in detail. The comparisons show our algorithm is three times faster than the fastest of them for multiset permutations. Our memory consumption is under 800Kb, which is very low for today’s computers. We also introduce an evaluation method to calculate the average time of multiset permutations for all possible N N inputs with each fixed length N. [Key words] multiset permutation algorithm目录 第一章 引言 6 第二章 研究背景 7 2.1多重集排列的相关定义 7 2.2全排列问题的研究历史 7 2.2.1 单重集排列问题的研究历史 8 2.2.2 多重集排列问题的研究历史 8 2.3历史上的主要经典算法 10 2.3.1 Heap递归算法 10 2.3.