alt Hacker NewsBig O Notation omis constant factors that tend to be significantly larger for log-n algorithms.
I think he talked from personal experience.
Big O Notation omis constant factors that tend to be significantly larger for log-n algorithms.
I think he talked from personal experience.
Could be. But very poorly stated if so.
Anyway, I do not think that even "typically" such statement can remotely be truth. It is 2 orders of magnitude away (20 to 5000).