(37) Amount of time required by the dynamic programming algorithm for finding the optimal parenthesization of a sequence of n matrices
(A)O(n log n)
(B)O(log n)
(C)O(n²)
(D)O(n³)
(E)O(n)

1. 題目解析這道題目詢問的是使用動態...