HN
Hacker News
Top
New
Best
Ask
Show
Jobs
Comment by tessro | Hacker News Reader
Parent
Full thread
tessro
·
Surely you could implement this search in at least O(n) time?
View on HN
aperiodic
·
That's assuming that you can verify whether or not any given person gives a shit about Haskell in O(1) time.
eru
·
At least is easy. At most is hard.
wahnfrieden
·
"At least, if not better." The context disambiguates the direction of magnitude.
Reply on news.ycombinator.com