摘要
二路归并排序算法的思想比较容易理解.在实现的过程中,可以有多种方法,其中利用分治策略,借助递归树让学生认清递归和分治是解决这一问题的有效途径.
It is easy to understand the concept of 2-way merge sort algorithms. And there is plethora of methods in the process of its realization. The paper, utilizing divide-and-conquer strategy and recursion-tree, attempts to make students acknowledge that divide-and conquer and recursion are an efficient method to solve this problem.
出处
《喀什师范学院学报》
2008年第6期60-61,共2页
Journal of Kashgar Teachers College
关键词
分治策略
递归树
二路归并排序
教学
Divide-and-conquer strategy
Recursion-tree, 2-way merge sort
Teaching