原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
OPTIMAL-BST computes the rows from bottom to top and from left to right within each row.
The OPTIMAL-BST procedure takes Θ(n3) time
, just like MATRIX-CHAIN-ORDER. Its running time is O(n3), since its for loops are nested
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea