归并排序法的非递归实现

The Non-recursion Algorithmic of Merging Sort

本文给出了一种易理解的非递归的归并排序法算法,该算法沿用了原递归算法的Merge子程序,程序简洁,其可理解性和直观性不亚于原递归实现方法,可用于计算机专业“数据结构”课程的教学。

The non-recursion algorithmic of merging sort is proposed. It adopts the merge subroutine which is used in the recursion algorithmic of merging sort. It is no less understandable than the recursion algorithmic of merging sort. The non-recursion algorithmic of merging sort can be used in teaching of Data Structure Course.