摘要
当元素个数n≤c1,(c1为某一依赖于机器和语言环境的常数)时,简单插入排序的性能最佳;当c1≤n≤c2时(c2为某一依赖于机器和语言环境的常数),快速排序的性能最佳;当n>c2时,归并排序的性能最佳。结合简单插入排序,快速排序和归并排序,提出组合式排序算法,理论分析和实验表明,新算法的性能优于快速排序算法和归并排序算法。
Sorting algorithms were widely studied in both theory and algorithm design. Combining insertion sort, quick sort and merge sort, a new sort algorithm called combination sort is proposed. The time complexity and space complexity of the new algorithm is much better than that of insertion sort, quick sort and merge sort.
出处
《安徽工业大学学报（自然科学版）》
CAS
2006年第4期449-452,共4页
Journal of Anhui University of Technology（Natural Science）
