摘要
设法用减少插入序列长度的办法,提出一种快速插入的排序方法。给出了算法思想、算法描述、算法分析和实验结果。其理论意义是改进了插入排序法的时间复杂度,其实用价值是该排序法的排序效率比直接插入排序法提高43％左右。
This paper puts forward to a sort method of quick insertion through trying to shorten the length of insertion sequence. It also provides the algorithmic idea, the algorithmic description, the algorithmic analysis and the experiment result. The theoretical significance is that the time complexity of straight insertion sort have been improved, and the practical value is that the sort efficiency have been improved about 43% more than straight insertion sort.
出处
《计算机工程与设计》
CSCD
2003年第2期77-80,共4页
Computer Engineering and Design
