- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Introduction of Algorithm and its Analysis
* Introduction to Algorithm design and analysis Example: sorting problem. Input: a sequence of n number ?a1, a2, …,an? Output: a permutation (reordering) ?a1, a2, …,an? such that a1? a2 ? … ? an . Different sorting algorithms: Insertion sort and Mergesort. * Efficiency comparison of two algorithms Suppose n=106 numbers: Insertion sort: c1n2 Merge sort: c2n (lg n) Best programmer (c1=2), machine language, one billion/second computer A. Bad programmer (c2=50), high-language, ten million/second computer B. 2 (106)2 instructions/109 instructions per second = 2000 seconds. 50 (106 lg 106) instructions/107 instructions per second ? 100 seconds. Thus, merge sort on B is 20 times faster than insertion sort on A! If sorting ten million numbers, 2.3 days VS. 20 minutes. Conclusions: Algorithms for solving the same problem can differ dramatically in their efficiency. much more significant than the differences due to hardware and software. * Algorithm Design and Analysis Design an algorithm Prove the algorithm is correct. Loop invariant. Recursive function. Formal (mathematical) proof. Analyze the algorithm Time Worse case, best case, average case. For some algorithms, worst case occurs often, average case is often roughly as bad as the worst case. So generally, worse case running time. Space Sequential and parallel algorithms Random-Access-Model (RAM) Parallel multi-processor access model: PRAM * Insertion Sort Algorithm (cont.) INSERTION-SORT(A) for j = 2 to length[A] do key ? A[j] //insert A[j] to sorted sequence A[1..j-1] i ? j-1 while i 0 and A[i]key do A[i+1] ? A[i] //move A[i] one position right i ? i-1 A[i+1] ? key * Correctness of Insertion Sort Algorithm Loop invariant At the start of each iteration of the for loop, the subarray A[1..j-1] contains original A[1..j-1] but in sorted order. Proof: Initialization : j=2, A[1..j-1]=A[1..1]=A[1], sorted. Maintenance: each iteration
您可能关注的文档
- Influence of the new rules on Business and Innovation Centres.ppt
- 教你如何建账,结账.doc
- 教你如何彻底删除硬盘上被隐藏的分区.doc
- Influence of the US Constitution on World Political Systems.ppt
- 教你如何感官判断优质泥炭.doc
- 教你如何成为一个羽毛球高手.docx
- 教你如何把握投资中的节奏.doc
- Information Overload and the Design and Implementation of.ppt
- 教你如何把衣服洗干净.doc
- 教你如何拍出清晰锐利照片.doc
文档评论(0)