If for an algorithm time complexity is given by O(1) then complexityof it is:

If for an algorithm time complexity is given by O(n) then complexityof it is:

What is the time complexity of this algorithm?

What is the time complexity of this algorithm?

Why is this not a sequence?

Start car

Put in key

Turn key

Drive away

Time Complexity of this program:

def f():

a = 0

for i = 1 to n:

a += i;

b = 0

for i = 1 to m:

b += i;

If for an algorithm time complexity is given by O(1) then complexityof it is:

If for an algorithm time complexity is given by O(n) then complexityof it is:

Indicate constant time complexity in terms of Big-O notation

Indicate exponential time complexity in terms of big-O notation

Find the slowest time complexity

Which notation is consistent for every execution?

The O (n!) is so inefficient, there is no practical use for it

O (n log n) is the worst case scenario for

O  $$n^2$$  is the worst case scenario for