3 ms·
I dunno. O(n^2) is for sure a bug. But O(nlogn) I think is reasonable.
by Ono-Sendai 2y ago
I dunno. O(n^2) is for sure a bug. But O(nlogn) I think is reasonable.
- badmintonbaseba 2y agoO(nlogn) is probably reasonable. Why break up a long function then if you are experiencing O(nlogn) scaling of compile time on function size?
- Ono-Sendai 2y agoBecause it can still result in compile times I find excessive. For example breaking up a function that takes 5 seconds to compile into a bunch of functions that take 1 to 2 seconds in total.