中山大学数据结构课件Chapter2 Program Performance.pdfVIP

Chapter 2 Program Performance 信息科学与技术学院 黄方军 data_structures@163.com 东校区实验中心B502 数据结构算法与应用 Bird’s-Eye View • Determing the memory and time requirements of a program. • Measuring the time requirements of a program using the operation count and step count approaches. • Using asymptotic notations such as big oh, theta, and little oh. • Measuring the actual run time of a program using a clocking function. Chapter 2 Bird’s-Eye View • Searching an array of elements for one with a specified characteristic. • Sorting an array of elements. Codes for the rank (or count) sort, selection sort, bubble sort, and insertion sort menthods are developed. • Evaluating a polynomial using Horner’s rule. • Performing matrix operations such as add, transpose, and multiply. Chapter 2 2.1 Introduction The performance of a program, we mean the amount of computer memory and time needed to run a program. • Space complexity. • Time complexity. Chapter 2 2.2.1 Components of Space complexity Instruction space  The compiler used to compile the program into machine code.  The compiler options in effect as the time of compilation.  The target computer. Chapter 2 2.2.1 Components of Space complexity a+b+b*c+(a+b-c)/(a+b)+4 Load a Load a Load a Sub c Add b Add b Add b Store t4 Store t1 Store t1 Store t1 Load a Sub