Wrapping Up
Now that we understand Big O Notation, we have a consistent system that allows us to compare any two algorithms. With it, we will be able to examine real-life scenarios and choose between competing data structures and algorithms to make our code faster and able to handle heavier loads.
In the next chapter, we’ll encounter a real-life example in which we use Big O Notation to speed up our code significantly.
Copyright © 2018, The Pragmatic Bookshelf.
Get A Common-Sense Guide to Data Structures and Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
