HN
Hacker News
Top
New
Best
Ask
Show
Jobs
Comment by Retric | Hacker News Reader
Parent
Full thread
Retric
·
O( (n/log(n))^2 ) > 0(n^1.99999999999999) for sufficently large N
View on HN
judemelancon
·
Yes, the fact it's >O(n^k) for all k in [1,2) is why it's not strongly. It's still less than O(n^2).
Reply on news.ycombinator.com