in Algorithms
938 views
1 vote
1 vote

in Algorithms
938 views

4 Comments

E2 is right 

in E1 , K and E  is constant 

and time complexity depends on 'n' 

0
0
3^n n^2 is much more than 2^n n^3 hence E2 complexity is O(3^n n^2)
0
0
I think it is Option D.

E1 is  not correct . what if K=2  E= 2 in E1 ?   So shoild be D i think
0
0

1 Answer

0 votes
0 votes

E1 is correct E2 is in correct

 

Solution