Difference between big oh and theta notation and omega c++
Answers
Answered by
0
ffffffffffffffffffffffffffffffffff
Answered by
0
In order to define the time complexity in algorithms of asymptotic analysis, these three notations are used.
Big O: The upper bound of algorithm is represented by Big O notation. Only the above function is bounded by Big O. The asymptotic upper bond is given by Big O notation.
Theta: The bonding of function from above and below is represented by theta notation. The exact asymptotic behavior is done by this theta notation.
Omega: The algorithm's lower bound is represented by Omega notation. The asymptotic lower bond is given by Omega notation.
Similar questions