1.0Camdemy1.0http://media.usc.edu.tw二維陣列: 矩陣鏈乘積最佳化問題(Optimal Array Multiplication Sequence)http://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/c/cda3b6b57e1ecb1f/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare599' frameborder='0' src='http://media.usc.edu.tw/media/e/599' allowfullscreen></iframe>video72040534:25矩陣鏈乘積最佳化問題Matrix Chain Multiplication01Observation 1: different parenthesized leads to different complexity02Observation 2.1: How to parenthesize?03Observation 2.2: How to parenthesize?04Observation 2.3: How to parenthesize?05Observation 2.4: How to parenthesize?06Observation 2.4: How many combinations?07Complexity: 1*(n-1)+2*(n-2)+…+(n-1)*1=O(n3)08Design Issue 1: use one dimensional array to record size of matrixes09Design Issue 2: all possible combinations represent on a two dimensional array010矩陣鏈乘積最佳化問題Matrix Chain Multiplication011fs1280x720720x4041280x720http://media.usc.edu.tw/sysdata/doc/c/cda3b6b57e1ecb1f/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/c/cda3b6b57e1ecb1f/cover.jpghttp://media.usc.edu.tw/sysdata/doc/c/cda3b6b57e1ecb1f/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/c/cda3b6b57e1ecb1f1