算法导论(第二版)带页码目录（Introduction to Algorithms (Second Edition) with a directory page）.doc

下载文档 降价啦

8
0
约7.5千字
约 16页
2017-08-21 发布于河南
举报
版权申诉
保障服务

算法导论(第二版)带页码目录（Introduction to Algorithms (Second Edition) with a directory page）.doc

1、本文档共16页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

算法导论(第二版)带页码目录（Introduction to Algorithms (Second Edition) with a directory page）

算法导论(第二版)带页码目录（Introduction to Algorithms (Second Edition) with a directory page） Introduction to Algorithms (Second Edition) The directory -4 The first part of the basic knowledge 1 1 algorithm in the calculation of the 3 The 1.1 algorithm 3 1.2 as a technique of algorithm 6 2 Introduction to algorithms 9 2.1 insertion sort 9 The 2.2 algorithm analysis 12 The 2.3 algorithm design 16 2.3.1 method 16 2.3.2 method analysis 20 The 3 function of the growth of 26 3.1 asymptotic mark 26 3.2 standard mark and common functions 31 4 recursive 38 4.1 substitution 38 4.2 recursive tree method 40 The 4.3 main methods: 43 Proof of the main theorem 45 *4.4 That is the power of 4.4.1 45 The 4.4.2 integral function and integral function 48 5 probabilistic analysis and randomized algorithms 54 5.1 hire 54 The 5.2 indicator random variables 56 5.3 random algorithm 58 Further using *5.4 probability analysis and indicator random variables 62 5.4.1 birthday paradox 62 5.4.2 ball and box 64 5.4.3 series 64 5.4.4 online employment problem 66 The second part sorting and order statistics 71 6 heap sort 73 6.1 piles of 73 6.2 keep the 74 properties of pile 6.3 construction of the heap 76 6.4 heap sorting algorithm 78 6.5 priority queue 80 7 quick sort 85 7.1 quick sort description 85 7.2 quick sort performance 88 The randomized version 7.3 quick sort 90 7.4 quick sort analysis 91 7.4.1 worst case analysis 91 The expected running time of 7.4.2 92 8 linear time sequence 97 8.1 lower bound of 97 time sorting algorithm 8.2 counting sort 98 8.3 radix sort 100 8.4 bucket sort 102 The 9 median and order statistics 108 9.1 minimum value and a maximum value of 108 9.2 to 109 linear time 9.3 worst-case linear time selection 112 The third part of the data structure 117 10 basic data structure 119 10.1 stack and queue 119 10.2 list 121 10.3 pointers and objects to achieve 124 127 10.4 have the root of the tree. 11 hash table 132 11.1 direct addressing table 132 11.2 hash table 133 11.3 hash function 137