原书出处
Introduction to Algorithms, Fourth Edition
2 第2章 算法入门
e more efficient than another if its worst-case running time has a lower order of growth.
Due to constant factors and lower-order terms, an algorithm whose running time has a higher order of growth might take less time for small inputs than an algorithm whose running time has a lower order of growth.
But on large enough inputs, an algorithm whose worst-case running time is Θ(n2), for exam
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea