In this video, we will checkout
(i) What does time or space complexity expressed in Big Theta Notation tells us
(ii) What is asymptotically tight bound, what is tightest upper bound and tightest lower bound
(iii) A relationship between Big O, Big Omega and Big Theta representations
(iv) A way to whether a function g(n) is a tight bound for a function f(n) or not
Link to the notes displayed in the video : http://bit.ly/4cjVpBd
#algorithm #algorithms #dsa #datastructures #datastructure #tutorial
