August 2020
Intermediate to advanced
508 pages
11h 53m
English
It’s clear that having a solid understanding of Big O Notation can enable you to identify slow code and select the faster of two competing algorithms.
However, there are situations in which Big O Notation will have us believe that two algorithms have the same speed, while one is actually faster. In the next chapter, you’re going to learn how to evaluate the efficiencies of various algorithms even when Big O isn’t nuanced enough to do so.
Read now
Unlock full access