原书出处
Introduction to Algorithms, Fourth Edition
3 第3章 运行时间的刻画
O(n), Ω(n), and Θ(n), again with Θ(n) the most precise and therefore the most preferred.
Here is what we cannot correctly say: insertion sort’s running time is Θ(n2). That is an overstatement because by omitting “worst-case” from the statement, we’re left with a blanket statement covering all cases.
The error here is that insertion sort does not run in Θ(n2) time in all cases since, as w
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea