A Beginner's Guide to The Big O Notation

Big O Notation is used to describe the performance of an algorithm. Big O is used for the worst-case scenario and the average case scenario of the algorithm. It is the most common Big O notation, the O(n) notation. This article will help you understand the basics of the craziness that is Big O. It will be using JavaScript throughout the article but you can use any language of your choice. The most common notation is O(1), it simply means the operation will always execute in a constant amount of time regardless of how big the input size is.