摘要
为丰富2O(n)阶排序算法的种类,以更好地服务于教学科研和日常应用,提出了一种新的排序算法—双向选择排序算法.通过数学方法分析得知:该算法的时间复杂度为2O(n),空间复杂度为O(1).通过实验对比得知:在相同条件下,该算法的运行时间平均为冒泡排序的27%、简单选择排序的62%、直接插入排序的88%.
In order to add the kinds of the sort algorithms which have the complexity of 2O（n） 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 2O（n） 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.
出处
《计算机系统应用》
2016年第1期171-174,共4页
Computer Systems & Applications
关键词
双向
选择
排序
bidirectional
select
sort
