Chapter 2 Fundamentals of the Analysis of Algorithm Efficiency.pptVIP

下载本文档

3
0
约2.28万字
约 45页
2016-10-07 发布于重庆
举报
版权申诉

Chapter 2 Fundamentals of the Analysis of Algorithm Efficiency.ppt

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

Chapter 2 Fundamentals of the Analysis of Algorithm Efficiency

* Examples: 10n is O(n2) since 10n ≤ 10n2 for n ≥ 1 or 10n ≤ n2 for n ≥ 10 c n0 5n+20 is O(10n) since 5n+20 ≤ 10 n for n ≥ 4 c n0 * Examples: 10n is O(n2) since 10n ≤ 10n2 for n ≥ 1 or 10n ≤ n2 for n ≥ 10 c n0 5n+20 is O(10n) since 5n+20 ≤ 10 n for n ≥ 4 c n0 * Examples: 10n is O(n2) since 10n ≤ 10n2 for n ≥ 1 or 10n ≤ n2 for n ≥ 10 c n0 5n+20 is O(10n) since 5n+20 ≤ 10 n for n ≥ 4 c n0 * Examples: 10n is O(n2) since 10n ≤ 10n2 for n ≥ 1 or 10n ≤ n2 for n ≥ 10 c n0 5n+20 is O(10n) since 5n+20 ≤ 10 n for n ≥ 4 c n0 * * * * * * * * * * * * * * Note the difference between the two recurrences. Students often confuse these! F(n) = F(n-1) n F(0) = 1 for the values of n! ------------ M(n) =M(n-1) + 1 M(0) = 0 for the number of multiplications made by this algorithm * * * * * * * * * A. Levitin “Introduction to the Design Analysis of Algorithms,” 3rd ed., Ch. 2 ?2012 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved. * Example 3: Matrix multiplication A. Levitin “Introduction to the Design Analysis of Algorithms,” 3rd ed., Ch. 2 ?2012 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved. * Example 4: Gaussian elimination Algorithm GaussianElimination(A[0..n-1,0..n]) //Implements Gaussian elimination of an n-by-(n+1) matrix A for i ? 0 to n - 2 do for j ? i + 1 to n - 1 do for k ? i to n do A[j,k] ? A[j,k] - A[i,k] ? A[j,i] / A[i,i] Find the efficiency class and a constant factor improvement. A. Levitin “Introduction to the Design Analysis of Algorithms,” 3rd ed., Ch. 2 ?2012 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved. * Example 5: Counting binary digits