华南理工大学数据结构chapter1 and chapter3.pptVIP

* It provides more information in this example to say O(n2) than O(n3). * * * * For polynomial equations on T(n), we always have ?. There is no uncertainty, since once we have the equation, we have a “complete” analysis. * * 2. Ignore constants. 3. Drop low order terms. 4. Useful for analyzing loops. * Asymptotic analysis is defined for equations. We need to convert programs to equations to analyze them. The traditional notation is ?(1), not ?(c). ?(n) even though the value of sum is n2. * First statement is ?(1). Double for loop is ?i = ?(n2). Final for loop is ?(n). Result: ?(n2). *