离散数学英文讲义：3-3 Compleixty.pptVIP

Need algorithms first for this example. Company Logo L o g o L o g o * * Discrete Mathematics South China University of Technology Dr. Han Huang * * Section 3.3 Chapter 3. Algorithms, Division and Matrix * * Contents Introduction 1 Time Complexity 2 Time Complexity of Algorithm 3 * * Introduction * What is complexity? The word complexity has a variety of different technical meanings in different research fields. There is a field of complex systems, which studies complicated, difficult-to-analyze non-linear and chaotic natural artificial systems. Another concept: Informational or descriptional complexity: The amount of information needed to completely describe an object. As studied by Kolmogorov, Chaitin, Bennett, others… In this course, we will study algorithmic or computational complexity. * §2.3: Algorithmic Complexity The algorithmic complexity of a computation is, most generally, a measure of how difficult it is to perform the computation. That is, it measures some aspect of the cost of computation (in a general sense of “cost”). Amount of resources required to do a computation. Some of the most common complexity measures: “Time” complexity: # of operations or steps required “Space” complexity: # of memory bits req’d * Complexity Depends on Input Most algorithms have different complexities for inputs of different sizes. E.g. searching a long list typically takes more time than searching a short one. Therefore, complexity is usually expressed as a function of the input length. This function usually gives the complexity for the worst-case input of any given length. * Complexity Orders of Growth Suppose algorithm A has worst-case time complexity (w.c.t.c., or just time) f(n) for inputs of length n, while algorithm B (for the same task) takes time g(n). Suppose that f??(g), also written . Which algorithm will be fastest on all sufficiently-large, worst-case inputs? * * Time Complexity * Example 1: Max algorithm Problem: Find the simplest form of th