国外算法设计和分析18.ppt

Review Overview Fundamentals of Analysis of Algorithm Efficiency Algorithmic Techniques Brute force Divide-and-Conquer Decrease-and-Conquer Transform-and-Conquer Dynamic Programming Greedy Technique Data Structures Heaps Graphs– adjacency matrices adjacency linked lists Trees Fundamentals of Analysis of Algorithm Efficiency Basic operations Worst-, Best-, and Average-case time efficiencies Orders of growth Efficiency of non-recursive algorithms Efficiency of recursive algorithms Worst case efficiency Efficiency (# of times the basic operation will be executed) for the worst case input of size n, for which The algorithm runs the longest among all possible inputs of size n. Best case Efficiency (# of times the basic operation will be executed) for the best case input of size n, for which The algorithm runs the fastest among all possible inputs of size n. Average case: Efficiency (#of times the basic operation will be executed) for a typical/random input NOT the average of worst and best case Orders of Growth Three notations used to compare orders of growth of algorithms O(g(n)): class of functions f(n) that grow no faster than g(n) Θ (g(n)): class of functions f(n) that grow at same rate as g(n) Ω(g(n)): class of functions f(n) that grow at least as fast as g(n) Theorem If t1(n) ? O(g1(n)) and t2(n) ? O(g2(n)), then t1(n) + t2(n) ? O(max{g1(n), g2(n)}). The analogous assertions are true for the ?-notation and ?-notation. The algorithm’s overall efficiency will be determined by the part with a larger order of growth. 5n2 + 3n + 4 Using Limits for Comparing Orders of Growth limn→∞ T(n)/g(n) = Summary of How to Establish Orders of Growth of an Algorithm Method 1: Using limits. Method 2: Using the theorem. Method 3: Using the definitions of O-, ?-, and ?-notation. Basic Efficiency classes Time Efficiency Analysis of Nonrecursive Algorithms Steps in mathematical analysis of nonrecursive algorithms: Decide on parameter n indicating input size Identify algor