August 2017
Intermediate to advanced
222 pages
5h 3m
English
Content preview from A Common-Sense Guide to Data Structures and AlgorithmsBecome an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Chapter 5Optimizing Code with and Without Big O
We’ve seen that Big O is a great tool for contrasting algorithms and determining which algorithm should be used for a given situation. However, it’s certainly not the only tool. In fact, there are times where two competing algorithms may be described in exactly the same way using Big O Notation, yet one algorithm is significantly faster than the other.
In this chapter, we’re going to learn how to discern between two algorithms that seem to have the same efficiency, and select the faster of the two.