What is Asymptotic Notation
For Complete YouTube Video: Click Here
In this class, we will try to understand What is Asymptotic Notation.
Our previous class has already discussed the definitions of Time and Space complexities.
What is Asymptotic Notation
An Asymptotic notation enables us to make meaningful (but inexact) statements about an algorithm’s time and space complexities.
We have covered how to find the time complexity of an algorithm.
Once an algorithm’s time complexity is found, we can notate the algorithm with asymptotic notations by which we can derive meaning statements about an algorithm.
There are three types of Asymptotic notations.
- Big O Notation
- Omega Notation
- Theta Notation
Consider the algorithm as shown below.
The time complexity of the above algorithm is 2n + 3.
We can notate the algorithm by n.
By this notation, we can derive some statements.
In the next classes, we understand the meaningful statements derived from every notation.