π Big O
On a mathematical tool used to calculate time complexity in software algorithms.
Also known as Landau's notation, it allows for measuring the speed of a given function based on the specifics of its implementation, where O is the rate of growth of the function, standing for its order of approximation. This effectively allows for easier comparison of the implementations, ultimately making it possible to deliver an optimal solution for a given problem.