原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
rrences that are not equations, but rather inequalities, such as T (n) ≤ 2T (n/2) + Θ(n).
Because such a recurrence states only an upper bound on T (n), we express its solution using O-notation rather than Θ-notation.
Similarly, if the inequality is reversed to T (n) ≥ 2T (n/2) + Θ(n), then, because the re
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea