Hacker News Reader

Think it should be logarithmic (n log(n)) or polynomial (n^2)

+1, by personal experience, O(n log(n)) sounds about right.

(Actually, n log(n) + a constant offset; i.e. partitioning the code has its limits where it becomes detrimental.)

Good point