A Common-Sense Guide to Data Structures and Algorithms

In order to help ease communication regarding time complexity, computer scientists have borrowed a concept from the world of mathematics to describe a concise and consistent language around the efficiency of data structures and algorithms. Known as Big O Notation, this formalized expression around these concepts allows us to easily categorize the efficiency of a given algorithm and convey it to others. Once you understand Big O Notation, you’ll have the tools to analyze every algorithm going forward in a consistent and concise way—and it’s the way that the pros use.