Large o symbol/large ω sign/large theta symbol/small o symbol/small w symbol etc various algorithms complexity notation meaning __ algorithm complexity definition symbol

The large o sign (English: Big O notation) is a mathematical symbol used to describe the asymptotic behavior of a function. To be more precise,

It uses another (usually simpler) function to describe the asymptotic upper bound of a function's order of magnitude.

The definition of the large Omega symbol is similar to that of the big O symbol, but the main difference is that the large O sign function grows to a certain

The degree is always less than a particular function of the constant number of times, the large Omega symbol is always greater than, to describe a function of the order of magnitude

asymptotically lower bound.

The large theta symbol is the combination of the Big O symbol and the large Omega symbol. The specific mathematical definitions are given below:

The function f (n) represents the workload (efficiency) of an algorithm in the case of an input size of n, then when n tends to be large, we compare F (n) with the function g (n) known to another behavior:

1 if 0, it is said that f (n) is strictly less than g (n) on the order of magnitude, and is written as f (n) =o (g (n)).

2 If, then the F (N) is said to be strictly greater than g (n) on the order of magnitude (n) =w (g (n)).

3) If c, where C is a non 0 constant, it is said that f (n) is equal to G (n) at the order of magnitude, that is, f (n) and g (n) are the same order of magnitude, which is: f (n) =θ (g (n)).

4 if f (n) is less than or equal to G (n) at the order of magnitude, it is written as f (n) =o (g (n)).

5 if f (n) is greater than or equal to G (n) at the order of magnitude, it is written as f (n) =ω (g (n)).