归并排序的概念与算法设计
Concept and Algorithm Design of Merge Sort
邹永林1
作者信息
- 1. 常熟理工学院计算机学院，常熟 215500
- 折叠
摘要
从算法思想和排序过程两方面讨论归并排序和合并排序的区别，指出归并排序算法不能以合并排序算法完全替代；进而借鉴合并排序算法设计符合标准的归并排序思想的算法，并通过实例验证算法的正确性。
Abstract
Discusses the differences between merge sort (order by merging) and merge sort (sequencing by merging) on two aspects of algorithm thought and sorting process, points out that the algorithm of merge sort (order by merging) cannot be entirely replaced by merge sort (se-quencing by merging);designs the algorithm of merge sort (order by merging) referencing the standard merge sort algorithm, takes an ex-ample to verify the correctness of the algorithm.
关键词
归并排序/合并排序/分区/算法设计Key words
Order by Merging/Sequencing by Merging/Partition/Algorithm Design引用本文复制引用
出版年
2015
NETL
NSTL
维普
万方数据