国外算法设计与分析课件03.pptVIP

Fundamentals of the Analysis of Algorithm Efficiency Algorithm analysis framework Asymptotic notations Analysis of non-recursive algorithms Analysis of recursive algorithms Expected Outcomes The students should be able to List the key steps in an algorithm’s analysis framework Define the three asymptotic notations and explain their relations Compare the asymptotic growth rate of two given functions by using the definition of asymptotic notation or Limits Describe the key steps in analysis of a non-recursive algorithm and a recursive algorithm Use different ways to transform a recurrence relation into its closed form Analyze the time complexity of recursive algorithm for computing the nth Fibonacci number Analysis of Algorithms Analysis of algorithms means to investigate an algorithm’s efficiency with respect to resources: running time and memory space. Analysis Framework Measuring an input’s size Measuring running time Orders of growth (of the algorithm’s efficiency function) Worst-base, best-case and average-case efficiency Measuring Input Sizes Efficiency is defined as a function of input size. Input size depends on the problem. Example 1, what is the input size of the problem of sorting n numbers? Example 2, what is the input size of adding two n by n matrices? Units for Measuring Running Time Should we measure the running time using standard unit of time measurements, such as seconds, minutes? Depends on the speed of the computer. Count the number of times each of an algorithm’s operations is executed. Difficult and unnecessary Count the number of times an algorithm’s basic operation is executed. Basic operation: the operation that contributes the most to the total running time. For example, the basic operation is usually the most time-consuming operation in the algorithm’s innermost loop. Order of growth Most important: Order of growth within a constant multiple as n→∞ Example: How much faster will algorithm run on computer that is twice as fast? How m