算法导论 第十二章 动态规划 思考题.pptVIP

第十二章思考题 15.2-1,4 15.3-3 15.4-2 思考题讲解 1(p338 15.2-1)Find an optimal parenthesization of a matrix-chain product whose sequence of dimensions is 〈5, 10, 3, 12, 5, 50, 6〉. 思考题讲解 2(p338 15.2-4)Let R(i, j) be the number of times that table entry m[i, j] is referenced while computing other table entries in a call of MATRIX-CHAIN-ORDER. Show that the total number of references for the entire table is 思考题讲解 3(p349 15.3-2) Draw the recursion tree for the MERGE-SORT procedure from Section 2.3.1 on an array of 16 elements. Explain why memoization is ineffective in speeding up a good divide-and-conquer al