3 ms·
I like to think of it in algorithmical terms. Maintaining the code is O(n) on the size of the code
by furstenheim 6y ago
I like to think of it in algorithmical terms. Maintaining the code is O(n) on the size of the code
- robjan 6y agoThink it should be logarithmic (n log(n)) or polynomial (n^2)
- furstenheim 6y agoGood point
- eqvinox 6y ago+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.)