Re:Why is printing “B” dramatically slower than printing “#”...
by mjevans on Thursday September 08, 2016 @02:09PM
(#12455530)
Probably that or some other case of selecting an algorithm without consideration of the /worst possible/ performance cases.
It may be better to try a generally good algorithm first, then if it fails after X iterations to fall back to an algorithm with a better bound on the worst case.
It may be better to try a generally good algorithm first, then if it fails after X iterations to fall back to an algorithm with a better bound on the worst case.