合并排序算法论文教程范本.docxVIP

合并排序算法研究1（1.河南大学 计算机与信息工程学院，河南 开封 475004）摘要：分治法是一种非常重要的解题方法，其基本思想是将一个规模为N的问题分解为K个规模较小的子问题，这些子问题互相独立且与原问题相同，递归的了解这些子问题，然后将各子问题的解合并得到原问题的解。合并排序算法即是运用分治策略来实现对N个元素进行排序的算法。文章论述的目的是建立在分治法的基础上，采用递归，非递归和自然合并排序三种方法来实现的合并排序算法，同时通过三种方法的时间复杂度和空间复杂度对三种方法的计算过程进行深入的探讨和研究，在仔细分析三种算法的优点和缺点并进行比较之后，最终得出对于所给的n元素数组已排序好序的极端情况，采用自然合并排序方法实现的合并排序算法明显优于非递归和递归方法实现的合并排序算法，因为它的合并过程中所需的合并次数较少时间复杂度最低。关键词：合并排序；递归；分治法；非递归Research on merge sort algorithmDUAN Xiao-yu11(College of Computer Science and Information Engineering, Henan University, Kaifeng475004, China)Abstract: The method is a very important problem solving method, the basic idea is to be a problem of size N K is decomposed into smaller sub problems, these problems are independent of each other and with the same problem, recursive understanding of these problems, and then combine their solutions to solve the original the solution of the problem. Merge sort algorithm is used to divide and conquer strategy to achieve sort of N element algorithm. This article aims to establish a recursive divide and conquer based on merge sort algorithm, non recursive merge sort and natural three ways to realize the in-depth discussion and research carried out at the same time through the three methods of time and space complexity of the three methods of the calculation process, after careful analysis advantages and disadvantages of these three algorithms were compared, obtained for n elements to the array is sorted by the extreme situation, natural merge sort merge sort algorithm implementation method is obviously better than the merge sort algorithm non recursive and recursive method to realize, because the required in the course of its merger with fewer the minimum time complexity.Key words: merge sort；Recursion；Divide and conquer method；non-recursive0引言分治策略是一种在排序算法中应用最多的方法之一，之前的研究当中都是对合并排序进行递归和非递归的研究但并未对自然合并排序进行详细的研究比较，本文的目的即对三种方法进行探讨并通过时间复杂度和空间复杂度来比较并得出结论。1分治法概述1.1分治法的描述所谓分治法，是指对一个输人规模为n的问题，用某种可行的方法把输人分割成1个子集从而产生k个规模较小的子问题，解出k个子问题后，再用某种方法把它们组合成原来问题的解