Explain the different types of asymptotic notations
Answers
Answered by
1
Big Oh Notation, Ο The notation Ο(n) is the formal way to express the upper bound of an algorithm's running time. ...
Omega Notation, Ω The notation Ω(n) is the formal way to express the lower bound of an algorithm's running time. ...
Theta Notation, θ
Omega Notation, Ω The notation Ω(n) is the formal way to express the lower bound of an algorithm's running time. ...
Theta Notation, θ
Answered by
0
Explanation:
hope helps you
have a nice day
Attachments:
Similar questions