算法分析与设计复习资料（Algorithm analysis and design review data）.docVIP

下载本文档

3
0
约1.48万字
约 21页
2017-07-21 发布于河南
举报
版权申诉

算法分析与设计复习资料（Algorithm analysis and design review data）.doc

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

算法分析与设计复习资料（Algorithm analysis and design review data）

算法分析与设计复习资料（Algorithm analysis and design review data） Analysis and design of algorithms A, question A   the worst time complexity The average  of time complexity I * is made in DN T (N, I *) reach Tmax (N) legal input  P (I) is the application of the algorithm in an I 2 what is recursive algorithm    recursive functions is what A   1  recursive algorithm, the algorithm directly or indirectly calls itself   2  recursive functions: the function itself define function. 3  recursive functions of  2 elements is A     boundary conditions 1 2  recursion equation 4 what is design idea   partition method A  will a problem of size n is decomposed into k smaller sub-problems, these subproblems are independent of each other and with the original problem The same. 5 nature of optimal substructure   what problem A  a problem of the optimal solution containing its problem of the optimal solution. This property is called optimal substructure property. 6 what   dynamic programming basic step A   1  to find the optimal solution of  nature and characterization of its structure features;  2  recursively defined the optimal value;  3  with a bottom-up approach to calculate the optimal value; (4) according to the calculation when the optimum information  structure optimal solution. 7 what are the basic elements of  dynamic programming algorithm  illustrates some questions can be solved by dynamic programming algorithm. A   1  nature of optimal substructure and overlapping subproblems properties are the basic elements of the dynamic programming algorithm  2 LianCheng  matrix recursive relations   and  optimal solution 0-1 knapsack problems 8  partition method and dynamic programming the similarities and differences of  A  with  solution of the basic idea is to be decomposed into several sub problems to solve the subproblem  first and then from these subproblems Get solution of original problem of  Different   1  suitable for using