Andrew Zonenbergazonenberg@ioc.exchange
Oct 29, 2026, 2:22 AM@sophieschmieg this is the problem with only doing asymptotic big-O analysis.
Constants are real and they can hurt you :p
Replies
- Andrew Zonenbergazonenberg@ioc.exchangeOct 29, 2026, 2:26 AM
@sophieschmieg like there are plenty of real world cases where a simple linear search on a very small dataset is faster than something with sublinear performance that has a high setup overhead
- Andrew Zonenbergazonenberg@ioc.exchangeOct 29, 2026, 2:29 AM
@sophieschmieg ditto for matrix multiplication, the simple O(n^3) algorithm is still better for smaller matrices than the newer ones with lower asymptotic complexity