retagged by
511 views
1 votes
1 votes
Devid  has an algorithm X for a problem with time complexity X that is polynominal over input size.

Jack has an algorithm Y for another problem with time complexity Y that is exponential over the input size,  

Michel has an alogrithm Z for another problem with time complexity Z that is double exponential over the input size.

which is correct

1.theta(X)=theta(y)

2.theta(X)=theta(Z)

3.theta(Y)=theta(Z)

4.O(Z)=X
retagged by

1 Answer

2 votes
2 votes
1. Θ (n) = Θ( e^n)  //Wrong

2. Θ(n) =Θ(e^2n) //Wrong

3. Θ( e^n)=Θ(e^2n)   //Wrong

4. n = O(e^2n)  //Correct

answer should be 4

Related questions

1 votes
1 votes
2 answers
1
Nitesh_Yadav asked Apr 11, 2022
266 views
What is the time complexity of the below mentioned recursive function.int f(n){ if(n!=1){ return f(n/2)+f(n/2);}elsereturn 10;} O(n)O(n^2)O(log n)O(n logn)
0 votes
0 votes
1 answer
2
raja11sep asked Jan 15, 2022
835 views
Can anyone explain each option, for every option if it is true then why? If false then why? (Please don’t comment like answer is A,B etc) Please help
2 votes
2 votes
2 answers
3
LRU asked Oct 15, 2021
624 views
Consider an array contains n integers, each integer belongs to {0, 1, 2}. What is the best case time complexity to sort an array?
0 votes
0 votes
0 answers
4
Ajit J asked Dec 8, 2018
363 views
Will the complexity of the function be $\Theta n^{2} or \Theta n^{3}?$