分而治之算法---快速排序（Divide and conquer algorithm --- quick sort）.docVIP

下载本文档

9
0
约8.18千字
约 8页
2017-09-06 发布于河南
举报
版权申诉

分而治之算法---快速排序（Divide and conquer algorithm --- quick sort）.doc

1、本文档共8页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

分而治之算法---快速排序（Divide and conquer algorithm --- quick sort）

分而治之算法---快速排序（Divide and conquer algorithm --- quick sort） Quick sort Divide and rule method can be used to achieve a completely different ranking methods, this ranking method called quicksort (quick sort). In this method, the n elements are divided into three sections (Group): l e f left t r i g h right t and I d d l e in M. The middle contains only one element. Left of the elements are less than or equal to the middle element, the right elements are larger than the middle element. The l e f t and R I g h t elements in the independent sort, and no need to l e f t and R I g h t results were combined. M I d d l e elements called (p i v o t point). Figure 14 - 9 gives the pseudo code quick sort. / / use quick sort method to sort a[0: n- 1] From a[0: n- 1] to select a m I d d l elements as e, the element as a fulcrum The remaining elements are divided into two sections of left and R I g h t l e f t, the elements are less than or equal to the pivot, and the elements of right are greater than or equal to the pivot Recursive use quick sort method to sort left Recursive use quick sort method to sort right The results of l e f t I d d l + m e + r i g h t The pseudo code of figure 14-9 quick sort Investigation of sequence of elements [4, 8, 3, 7, 1, 5, 6, 2]. Hypothesis selection element 6 as a fulcrum, 6 located in the M I d d l e; 4, 3, 1, 5, 2 in the l e f t; 8, 7 I g h t in R. When the left order, the result is 1, 2, 3, 4, 5; r i g h t when the order, the result is 7, 8. The elements in the right on the l e pivot element, f element in the T on the fulcrum elements before, to get the final results [1, 2, 3, 4, 5, 6, 7, 8]. The sequence of elements is divided into l e f t, M I d d l e and R I g h t can be performed in place (see 14 - 6). In the program of 14 - 6, always take the fulcrum in position 1 elements. Can also be used in other ways to improve the ranking performance, later in this chapter will be given such a choice. 14-6 quick sort program Template Void QuickSort