August 2024
Intermediate to advanced
516 pages
11h 47m
English
We’ve seen that Big O notation is a great tool for comparing algorithms and determining which algorithm should be used for a given situation. However, it’s certainly not the only tool. In fact, there may be times when two competing algorithms are described in the same way using Big O, yet one algorithm is faster than the other.
In this chapter, you’re going to learn how to discern between two algorithms that seem to have the same efficiency and how to select the faster of the two.
Read now
Unlock full access