This video is about Asymptotic Notations which are used in analyzing the Algorithms. Here we discuss about Big-o, Big-Ω and Big θ notations. Also we study about How to find Upper Bound, Lower Bound and Tight Bound for any time complexity function f(n) through various Examples.
