节点文献
常用排序算法的比较与分析
Compare and Analysis of Frequently-used Sorting Algorithms
【摘要】 排序是计算机领域的一种重要操作,实现方法有很多种。该文从算法的基本思想、时间复杂度、空间复杂度、稳定性和问题的规模n值大小等方面对常用的排序算法进行了比较分析,为各种实际应用领域选择、设计一个高效且合理实用的算法提供了依据。
【Abstract】 Sorting is an important operation in the computer areas,and there are many kinds of sorting algorithms.In this article,compared with the aspects such as basic sorting thought of algorithm,the order of time complexity,the space complexity,stabili ty,and the value of n,the frequently-used sorting algorithms are analyzed.The study on the differences of these algorithms is to provide a basis for the design of a high efficient and reasonable algorithm in the practical applications.
【关键词】 排序算法;
时间复杂度;
空间复杂度;
算法实现;
【Key words】 sorting algorithm; time complexity; space complexity; algorithm realization;
【Key words】 sorting algorithm; time complexity; space complexity; algorithm realization;
- 【文献出处】 电脑知识与技术 ,Computer Knowledge and Technology , 编辑部邮箱 ,2013年09期
- 【分类号】TP301.6
- 【被引频次】8
- 【下载频次】614