四川大学数据结构期末复习毛华老师.pdfVIP

Data Structures and Algorithms Final Review Hua Mao College of Computer Science Sichuan University Recursive Method 飦 Normally, we have methods that call other methods. 飦 i.e., the main() method calls the square ()method. main() square() 飦 Recursive Method: 飦 A recursive method is a method that calls itself. 飦 i.e., the compute() method makes a call to itself compute() Running Time For most algorithms, running time depends on the 鈥渟ize鈥 of the input. Given the size of the input, 肀 : 飦 饊伝聿傢矖聿 (肀?: the average running time 飦 Reflects typical behavior 飦 Often difficult to determine 飦 饊伝聿橅矏聿擁矓聿 (肀?: the worst-case running time 飦 A guarantee for on any possible input 飦 Easier to analyze 飦 Crucial to applications such as games, finance and robotics 飦 饊伝聿冺矄聿旐矔 (肀?: the best-case running time 飦 Occasionally鈥︹€ Big-Oh Meaning Definition: 饊伝 肀 = 肀?聿 (肀?)if there exist positive constants c and n such that 饊伝 肀 飩 c 鈭 聿 肀 for all N飩硁 0 0 飦 The growth rate of 饊伝 肀 is less than or equal to that of聿 肀 飦 Upper Bound on 饊伝 肀 飦 Usage: the algorithm is in 肀?肀 2) in [best, average, worst] case What you can drop 锛 飦 Eliminate coefficients because they grow as the same rate 2 2 飦 3n versus 5n doesn鈥檛 mean anything when we have not specified the cost of constant-time operations 飦 Eliminate low-order terms because they have vanishingly small impact as 肀 grows 飦 Consider less precision: No constants or low-order terms inside a Big-Oh. 飦 饊亣 肀 = 肀?2肀?) 饊亣 肀 = 肀?肀?) 飦 饊亣 肀 = 肀 肀? + 肀 飦 Do NOT ignore constants t