3 ms·
Agreed. There are plenty of cases where an asymptotically "worse" algorithm performs better than a "better" one for all practical sizes. Like it is very very m
by jsmith45 5y ago
Agreed. There are plenty of cases where an asymptotically "worse" algorithm performs better than a "better" one for all practical sizes.
Like it is very very much possible that the asymptotically "better" algorithms have coeffcients so high that the break even point takes like week or more of computation. There are not many programs where users will tolerate using it with so much data that operations take that long.