1、.193.3.1 Knuth 算法 .19IV3.3.2 模拟比较环境 .203.3.3 多重集排列算法的时间和内存比较 .213.3.4 单集排列算法的时间和内存比较 .233.3.5 TWDRI 算法与其它多重集排列算法的比较趋势分析 .25第四章 汇编分析 .264.1 分析工具 MIX.264.2 性能分析 .27第五章 总结与展望 .355.1 总结 .355.1.1 排列的应用 .355.1.2 总结 .355.2 未来的研究方向 .365.2.1 Hybrid algorithm.365.2.2 多线程并行算法 .39致谢语 .42参考文献 .43附录 .47VContentsC
2、hapter 1 Introduction.11.1 Background .11.2 Basic Concept.21.3 Main Content.41.4 Structure of This Thesis .4Chapter 2 Classical Algorithm.52.1 Algorithm Based On The Adjacent Exchange .52.1.1 Introduction .52.1.2 Representative Algorithm.62.2 Algorithm Based On Recursive.72.2.1 Introduction .82.2.2 Representative Algorithm.82.3 Algorithm Based On Iteration .92.3.1 Introduction .102.3.2 Representative Algorithm.102.4 Lexicographic Algorithm .112.4.1 Introduction .112.4.2 Representative Algorithm.122.5 Others .
