10-11-01ADA02(算法分析基础-整体框架).pptVIP

2007-2008-01《Design and Analysis of Algorithms》SCUEC Review of last class How to solve a problem by computer How to describe an algorithm? Natural language Step1 Input m and n. Step2 Divide m by n and assign the value of the remainder to r. Step3 If r=0, return the value of n as the answer and stop; otherwise, proceed to Step 4. Step4 Assign the value of n to m and the value of r to n. Step5 Go to Step2. How to describe an algorithm? (II) Flow chart How to describe an algorithm? (III) Programming language How to describe an algorithm? (IV) Pseudocode Goals of this lecture At the end of this lecture, you should be able to Describe how to analyze an algorithm Understand what is a best-case, worse-case and average-case analysis Master the three asymptotic notations ?, ?, O, rate of growth Analysis of algorithms Definition: Algorithm analysis means to evaluate the two computer resources, time and space, which needed by an algorithm. Less resources an algorithm needs, more efficiency it is. Issues: time efficiency Determines the amount of time that algorithm needs to be executed. space efficiency Determines the amount of space that algorithm needs to be executed. Approaches: theoretical analysis empirical analysis Theoretical analysis of time efficiency Goal: Determines the amount of time that an algorithm needs to be executed Methods: Determines the exact amount of time that an algorithm needs to be executed Determines the number of repetitions of all the operations as a function of input size and input instance Where N is the input size, I is the input instance. Operations Comparisons Equal, greater, not equal, … Logical operations And, or, xor, not, … Arithmetic operations Additions: add, subtract, increment, decrement Multiplications: multiply, divide, mod Assignment operation X = 1 For convenience, each elementary operation is considered to use 1 time unit. Size of Input Sorting and Finding problems: number of element in the array or table Grap