Asymptotic Complexity and Big O Notation

Explore the complexity of algorithms and Big O notation for representation in this lesson.

Asymptotic complexity

There is usually more than one way to solve a problem, and if efficiency is a concern, we should first focus on high-level optimizations by choosing the right algorithms and data structures. A useful way of evaluating and comparing algorithms is by analyzing their asymptotic computational complexity—that is, analyzing how the running time or memory consumption grows when the size of the input increases. In addition, the C++ standard library specifies the asymptotic complexity for all containers and algorithms, which means that a basic understanding of this topic is a must if you are using this library.

Get hands-on with 1200+ tech skills courses.