Hacker News Reader

I like to think of it in algorithmical terms. Maintaining the code is O(n) on the size of the code

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

Good point

+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.)