原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
n j. Each iteration of the for loop of lines 3–4 adds in one more term of equation (4.1).
Because each of the triply nested for loops runs for exactly n iterations, and each execution of line 4 takes constant time, the MATRIX-MULTIPLY procedure operates in Θ(n3) time.
Even if we add in the Θ(n2) time for initializing C to 0, the running time is still Θ(n3)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea