August 2024
Intermediate to advanced
516 pages
11h 47m
English
While all the techniques in this chapter are useful, you’ll find that some come in handy for certain scenarios, while others are effective for other scenarios.
This first technique, however, applies to all algorithms and should be the first step of your optimization process.
And here it is.
Once you’ve determined the efficiency of your current algorithm (the prereq), come up with what you believe to be what I call the “best-imaginable Big O.” (I’ve seen others refer to this as the “best-conceivable runtime” when applied to speed.)
Essentially, the best-imaginable Big O is the absolute best Big O you could dream of for the problem at hand. This is the Big O you know is absolutely impossible to beat.
For example, ...
Read now
Unlock full access