本文已被：浏览 2087次 下载 2641次
Received:May 02, 2015 Revised:June 27, 2015
Received:May 02, 2015 Revised:June 27, 2015
中文摘要: 为丰富O(n2)阶排序算法的种类,以更好地服务于教学科研和日常应用,提出了一种新的排序算法-双向选择排序算法.通过数学方法分析得知:该算法的时间复杂度为O(n2),空间复杂度为O(1).通过实验对比得知:在相同条件下,该算法的运行时间平均为冒泡排序的27%、简单选择排序的62%、直接插入排序的88%.
Abstract:In order to add the kinds of the sort algorithms which have the complexity of O(n2) and then serve teaching and daily application better, the paper proposes a new sort algorithm-bidirectional selection sort algorithm. Through mathematical method that the time complexity of the new algorithm is O(n2) and its space complexity is O(1). It is known by empirical method that the running time of the new algorithm is averagely 27 percent of bubble sort, and 62 percent of simple selection sort and 88 percent direct insertion sort in same condition.
keywords: bidirectional select sort
文章编号： 中图分类号： 文献标志码：
基金项目:
| Author Name | Affiliation |
| YUAN Guan-Wei | 69027 Troops, Urumqi 830000, China |
| Author Name | Affiliation |
| YUAN Guan-Wei | 69027 Troops, Urumqi 830000, China |
引用文本：
袁关伟.双向选择排序算法.计算机系统应用,2016,25(1):171-174
YUAN Guan-Wei.Bidirectional Selection Sort Algorithm.COMPUTER SYSTEMS APPLICATIONS,2016,25(1):171-174
袁关伟.双向选择排序算法.计算机系统应用,2016,25(1):171-174
YUAN Guan-Wei.Bidirectional Selection Sort Algorithm.COMPUTER SYSTEMS APPLICATIONS,2016,25(1):171-174
