原书出处
Introduction to Algorithms, Fourth Edition
3 第3章 运行时间的刻画
of size n for which the algorithm takes at least cn2 time, for some positive constant c.
It does not necessarily mean that the algorithm takes at least cn2 time for all inputs.
Let’s now see why the worst-case running time of INSERTION-SORT is Ω(n2). For a value to
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea