News for hackers. Stuff that matters.
Re:Do We Worship Complexity? by derefr on Tuesday October 16, 2018 @07:29PM (#18234203)
Frequently when writing O(n), the writer is making a comparison. e.g. "The GC was O(n log n) wrt memory, but now it's just O(log n)." That expands to a lot more text.

Or, to put that another way: there is a constant cost in human parsing complexity when writing "O(n)", but the number of parse-nodes in the text when using "O(n)" only increases as O(n), whereas without "O(n)", it increases with O(n^1.3). ;)

There are no comments on this comment yet.