Question

What is asymptotic notation in data structure

Answer 1

Asymptotic Notations are languages that allow us to analyze an algorithm's running time by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm's growth rate. ... Asymptotic Notation gives us the ability to answer these questions.

Answer 2

This are generally used to analyze time and space complexity of your algorithm or in simple words how long your code will take to execute.

There are 3 main asymptotic notation

1 Big-O

2 Theta

3 Omega

Thanks for asking