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

多重集的全排列算法研究暨分类 摘 要 Abstract The thesis is going to introduce TWDRI, a new optimized permutation algorithm of multiset. At the same time, almost all the algorithms of permutation of multiset are analyzed and classified due to their inner principles. To be equitable, we employ methodology summarized from experience to simulate and compare data of TWDRI to other well known/unknown algorithms in this field. We are pleased to see ideal speed in both pureset and multiset permutation processing. In the remainder of this thesis, we pay main attention to Gray code applied in the said field. We focus on its development progress status from when Gray code first introduced into this field to the newest application and comments, and some open problems would be issued which have not been resolved until now. In the end, expect possible development prospect and summarize direction developing and future of permutation of multiset, with the hope of constructing basis for possible future further studies in this said field. Key words TWDRI; multiset; pureset; permutation; Gray code; algorithm  目录 第一章 绪论 1 1.1课题背景和存在的问题 1 1.1.1 排列历史 1 1.1.2 纯排列算法的历史 1 1.1.3 多重集的全排列算法的历史 2 1.1.4 排列中的格雷码 2 1.2论文的主要内容 2 1.3 论文的组织结构 3 第二章 已有的排列算法的分析总结和分类 4 2.1基本概念 4 2.2分析总结与分类 7 第三章 新式的高性能的排列算法——TWDRI 16 3.1算法流程图 16 3.2 算法的时间复杂度分析 17 3.3 算法的应用和特点 18 第四章 排列算法中的格雷码应用研究 20 4.1初步的发展 20 4.2新世纪的发展 21 第五章 测试、模拟与比较 24 5.1基于随机输入的平均时间计算模型 24 5.2计算模型的推导过程 24 5.3模拟之后的比较结果 26 5.3.1多重集排列算法的时间和内存开销比较 26 5.3.2多重集算法在纯排列的情况下的时间和内存开销比较 28 5.3.3 TWDRI算法和其它纯排列算法的时间和内存比较 29 5.3.4 TWDRI 算法与其它多重集排列算法的比较趋势分析 30 第六章 总结与展望 32 致谢 36 参考文献 37  Contents Chapter 1 Introduction 1 1.1 Background and Problems 1 1.1.1 History of Permutation 1 1.1.2 History of Pureset Permutation Algorithm 1 1.1.3 History of Multiset Permutation Algorithm 2 1.1.4 Gray Code in Permutation 2 1.2 Main research 2 1.3 Outline of Thesis 3 Chapter 2 Analyse, summarise and classify existent permutation algorithms 4 2.1 Basic concept 4 2.2 Summary and classif