Hacker News Reader

"Finding a person who gives a shit about Haskell is an inherently NP-complete computer science problem. It's similar in scope and complexity to the problem of trying to find a tenured academic who didn't have the bulk of his or her work done by uncredited graduate students."

View on HN

Surely you could implement this search in at least O(n) time?

At least is easy. At most is hard.

"At least, if not better." The context disambiguates the direction of magnitude.

That's assuming that you can verify whether or not any given person gives a shit about Haskell in O(1) time.

Reply on news.ycombinator.com