[计算机软件及应用]DS02_Algorithm Analysis.pptVIP

Chapter 2 Algorithm Analysis Targets How to estimate the time required for a program How to reduce the running time of a program The results of careless use of recursion Very efficient algorithms Contents 2.1 What to Analyze 2.2 Asymptotic Notation ( ?, ?, ?, o ) (key point) 2.3 Compare the Algorithms (difficult point) 2.4 Logarithms in the Running Time(key point) Contents 2.1 What to Analyze 2.2 Asymptotic Notation ( ?, ?, ?, o ) (key point) 2.3 Compare the Algorithms (difficult point) 2.4 Logarithms in the Running Time(key point) Contents 2.1 What to Analyze 2.2 Asymptotic Notation ( ?, ?, ?, o ) (key point) 2.3 Compare the Algorithms (difficult point) 2.4 Logarithms in the Running Time(key point) Contents 2.1 What to Analyze 2.2 Asymptotic Notation ( ?, ?, ?, o ) (key point) 2.3 Compare the Algorithms (difficult point) 2.4 Logarithms in the Running Time (key point) Summary 2.1 What to Analyze 2.2 Asymptotic Notation ( ?, ?, ?, o ) (key point) 2.3 Compare the Algorithms (difficult point) 2.4 Logarithms in the Running Time(key point) Homework Paper Exercise: 2.1~2.3, 2.6, 2.8~2.10, 2.13, 2.15, 2.18 Programming: 2.12, 2.14, 2.16, 2.22, 2.23, 2.24 预习第3章 预习提示 三个关于计算机科学的“真理” 计算机软件工程就像是在漆黑的屋子里寻找黑猫。　　　　 计算机系统工程就像是在没有猫的黑屋子里寻找黑猫。　　　　 计算机知识工程就像是在没有猫的黑屋子里寻找黑猫，却有人大声说：“我抓到它了！” 我想到了数组和链表，这应该是最简单的结构了。 除了首尾元素（结点）之外，每个成员都只有唯一的前驱和唯一的后继。 下一次课我们将从最基本最简单的数据结构开始讨论。 对，说说它们的特点。 完全正确！不过，最简单的线性结构也有变型。 ? * / 33 CHAPTER 2 ALGORITHM ANALYSIS 【Definition】An algorithm（算法） is a set of instructions to accomplish（完成） a particular task. Criteria（准则）: (1) Input Zero or more quantities（量，值） are externally（从外部地） supplied. (2) Output At least one quantity is produced. (3) Definiteness（确定性） Each instruction is unambiguous(无歧义). (4) Finiteness（有限性） The algorithm terminates（终止） after finite number of steps. (5) Effectiveness（有效性） Every instruction must be basic enough to be carried out —— feasible（可行性） 〖Example〗 Selection Sort: Sort a set of