Big O notation is a mathematical notation used for describing the limiting behaviour of a function. As a developer (programmer), you could use Big O to understand the performance of an algorithm. By using this concept a developer can evaluate a function’s run-time based on the input(s) passed. A developer can also use it to compare algorithms' efficiency within the same domain. This comparison can well be for evaluating the performance. The algorithm that yields the lower Big O value is identified as the optimal one. Photo by Anni Roenkae from Pexels What is the "O" in Big O? “The letter O is used because the growth rate of a function is also referred to as the order of the function” - wikipedia ( https://en.wikipedia.org/wiki/Big_O_notation ). In the list below you can see the various functions: Notation Name O ( 1 ) Constant O ( log...