摘要
在计算机处理信息的过程中,排序算法是一种重要运算.二路归并排序所需要使用的辅助空间与待排序数据规模相同,空间占有量过大,有改进的必要.利用手摇法,我们可以实现原地二路归并,且时间效率也比较理想.
In the process of dealing with information, algorithm of sorting is a very important algorithm. The amount of additional space in sorting of 2-way merging is the same as the numbers, so it needs to be improved. We can implement in-place 2-way merging, and get good time complexity by handwaving.
出处
《西南民族大学学报（自然科学版）》
CAS
2009年第5期1087-1090,共4页
Journal of Southwest Minzu University(Natural Science Edition)
关键词
手摇法
原地
二路归并
handwaving
in-place
2-way merge
