Too Long; Didn't Read
Big O notation, collectively called Bachmann-Landau notation or asymptotic notation, is a way to describe the performance of an algorithm. It is used to classify algorithms according to how their run time or space requirements grow as the input size grows. The letter O is used because the growth rate of a function is also called its order. Big O Notation characterizes functions according to their growth rates. It describes the implementation of a algorithm in terms of the size of the input. The time complexity of this code is O(n).