Are you the author, or connect with the author? If so, remember that HN readers tend to be a lot more critical of the article than towards other comments. Any

Are you the author, or connect with the author? If so, remember that HN readers tend to be a lot more critical of the article than towards other comments. Anyway, the article didn't really claim to be the fastest heuristic, just an elegant one with some nice properties. It's O(n log n) - what more do people want? O(n)? O(1)? n log n is almost always fast enough.