review-divide 算法导论教学文稿.ppt

1 Framework for describing algorithms Correctness of algorithms Efficiency of algorithms Divide and Conquer Asymptotic analysis of function（渐近分析） Recurrences Reviews from chap1 to chap4 2 Examples: Merge sort Quick sort Multiplication of two integers Multiplication of two matrices Finding Minimum and Maximum Majority problem (多数问题) Reviews from chap1 to chap4 3 Exam0 Merge Sort See part2-chap2 …… 4 Exam1 Quick Sort See chap7 …… 5 Multiplication of two integers （整数相乘问题） X和Y是两个n位的十进制整数，分别表示为 X=xn-1xn-2...x0, Y=yn-1yn-2...y0，其中0 ≤ xi, yj ≤ 9 (i, j=0,1,…n-1) ，设计一个算法求X×Y，并分析其计算复杂度。说明：算法中“基本操作”约定为两个个位整数相乘xi×yj，以及两个整数相加。 Exam2 Multiplication of two integers（整数相乘） 8 Exam2 Multiplication of two numbers（整数相乘） two n-digit numbers X and Y, Complexity(X × Y) = ? Divide and Conquer algorithm Let X = a b , Y = c d then XY = (10ma+b)(10mc+d) = 102mac+10m(bc+ad)+bd Multiply(X; Y; n): if n = 1 return XY else m = n/2 a = X/10m; b=X mod 10m c = Y/10m; d=Y mod 10m e = Multiply(a; c; m) f = Multiply(b; d; m) g = Multiply(b; c; m) h = Multiply(a; d; m) return 102me + 10m(g + h) + f Complexity analysis: T(1)=1, T(n)=4T(n/2)+O(n). Applying Master Theorem, we have T(n)= O(n2). 9 Exam2 Multiplication of two integers（整数相乘） two n-digit numbers X and Y, Complexity(X × Y) = ? Divide and Conquer (Karatsuba’s algorithm) Let X = a b , Y = c d then XY = (10ma+b)(10mc+d) = 102mac+10m(bc+ad)+bd Note that bc + ad = ac + bd  (a  b)(c  d). So, we have FastMultiply(X; Y; n): if n = 1 return XY else m = n/2 a = X/10m; b=X mod 10m c = Y/10m; d=Y mod 10m e = FastMultiply(a; c; m) f = FastMultiply(b; d; m) g = FastMultiply(ab; cd; m) return 102me + 10m(e + f  g ) + f Complexity analysis: T(1)=1, T(n)=3T(n/2)+O(n). Applying Master Theorem, we have 10 Multiplication of two matrices （矩阵相乘问题） A和B是两个n阶实方阵，表示为 ， 设计一个算法求A×B，并分析计算复杂度。 说明：算法中“基本操作”约定为两个实数相乘，或两个实数相加。 Exam3