Too Long; Didn't Read
Big-O notation is the most commonly used to measure the complexity of algorithms. Memory usage is just as crucial as its runtime, so memory usage can be fatal inefficiencies. Compoundity is a metric called complexity portrayed in the letter “O” followed by an expression in brackets. O(n) means that the algorithm runtime or memory usage approaches n units as the input size n approaches infinity. The word O means that we equal an equal or shorter time or space measure at infinite input size.