Question

What is asymptotic time complexity of an algorithm?

Answer 1

Explanation:

The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation.

There are 3 asymptotic notation-

1) Ο Notation(Big oh notation)

2) Ω Notation(omega notation)

3) θ Notation (theta notation)

Answer 2

Explanation:

hope helps you

have a nice day