Lecture 7 Greedy Algorithms II cs贪心算法CS阅读7.bu.pptVIP

Lecture 8:Dynamic Programming Shang-Hua Teng First Example: n choose k Many combinatorial problems require the calculation of the binomial coefficient. This is equivalent to given n objects how many different ways can you choose k of them. Mathematically we have or, Consider Divide and Conquer Remember Pascal’s Triangle Consider triangle shape Looks like a two dimensional array. Create the triangle in this array and output A(i,j) for Do it algorithmically Matrix Chain Multiplication - Review Recall how to multiply matrices. Given two matrices The product is Time