Comment by autuni

> I have not checked most of the details, but I think that the claimed o(n log n) bound is plausible.

Stopped reading right after that. Why is this so high up on HN? It's literally nothing.