递归策略求解数据结构中归并排序算法

Recursion Strategy to Solve Merge Sort Algorithm in Data Structure

在递归概念的分析基础上,对递归策略求解归并排序问题进行了探讨。通过递归定义归并排序问题,明确了递归策略求解该排序问题的边界条件和递归模式。利用二叉树构建过程模拟归并排序的递归求解步骤,并结合面向对象程序设计思想设计了MergeSort类以封装归并排序数据源和相关排序、合并操作。这为学生理解并掌握递归策略设计算法提供了参考。

After analyzing the concept of recursion,it explores how to solve the merge sort problem by u- sing recursion strategy. In order to find the solution, recursively define the merge sort problem to explicit the boundary condition with the schema of recursion about it firstly. Utilizing the construction process of binary tree＇s to simulate the execution steps about the method. Then,design the MergeSort class based on object orient program method to encapsulate the data source of merge sort algorithm with its relating oper- ation, such as sorting, merging. It provides a consult view for students in understanding and mastering how to design algorithm by using reeursion strategy.