Asymptotic notation

Question 1

What is asymptotic notation?

Answer 1

Asymptotic notations are the mathematical notations used to describe the running time of an algorithm when the input tends towards a particular value or a limiting value.

Question 2

What is asymptotic complexity analysis?

Answer 2

It’s a method to describe limiting behavior, that is, knowing how the running time of a program behaves when it’s input size grows.

Question 3

Describe Big O notation

Answer 3

Big O notation describes an upper bound of an algorithm. It describes the limiting behavior of a program when it’s input tends towards infinity or a particular value.

Question 4

Describe Big Omega notation

Answer 4

Big Omega notation describes the best case scenario of a program’s behavior.

Question 5

Describe Big Theta notation

Answer 5

Big Theta notation can be used to describe algorithms where the best and worst cases are the same.