算法分析期末.docVIP

第一章 1. What is an algorithm? An algorithm is a sequence of unambiguous instructions for solving a computational problem, obtaining a required output for any legitimate input in a finite amount of time. 2. What are the properties of an algorithm? Finiteness--terminates after a finite number of steps Definiteness --each step must be rigorously and unambiguously specified. Input --valid inputs must be clearly specified. Can be 0 or many. Output--can be proved to produce the correct output given a valid input. at least, is one. Effectiveness--steps must be sufficiently simple and basic. 3. How to design algorithm? Understand the problem. Decide on—computational means、exact vs、approximate solving、data structure、algorithm design technique. Design an algorithm. Prove correctness. Analyze the algorithm. Code the algorithm. 小结：算法可以用自然语言或者伪代码表示，也可以用计算机程序的方式实现。 Algorithm can be specified in a natural language or a pseudocode ; they can also be implemented as computer programs. 第二章 Time efficiency indicates how fast an algorithm in question runs; Space efficiency deals with the extra space the algorithm requires. P45 基本的渐进效率类型 P46 习题5 小结 算法的时间效率主要用它输入规模的函数来度量，该函数计算算法基本操作的执行次数。基本操作是在总运行时间中贡献最大的操作。通常，它是算法的最内层循环中最费时的操作。 第三章 1. Brute force is a straightforward approach to solving a problem, usually directly based on the problem statement and definition of the concepts involved. 2.What are differences between Selection sort and Bubble sort? Sequence Key Efficiency Stable? Selection Sort R-L smallest n2 NO Bubble Sort L-R biggest n2 YES 3.Are Selection Sort and Bubble Sort stable sorts, for example? Selection Sort is not stable: ∣3 4 1 2 1 1∣ 4 1 2 3 1 1∣ 4 2 3 1 1 2∣ 4 3 1 1 2 3∣ 4 Bubble Sort is stable: 3 4 1 2 1 ∣ 3 1 2 1 ∣4 1 2 1 ∣3 4 1 1 ∣2 3 4 4.Analysize the traveling salesman problem and 0-1 knapsack Salesman:O(n!) 0-1 knapsack:O() 小结 The pri