Register

Algo rec
closed

• closed by
178 views
0 votes
0 votes
closed as a duplicate of: Time Complexity

What is the tightest upper bound to $T(n) = T(n-1) + 2^n$?

  • $O(n2^n)$
  • $O(2^n)$
  • $O(2^{2n})$
  • None
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Ajit J asked Dec 25, 2018
676 views
Self doubt- REC and RL
What is the intersection between recursive and recursive enumerable language? And also intersection between recursive and non-REL languages
What is the intersection between recursive and recursive enumerable language?And also intersection between recursive and non-REL languages
User Avatar
3 votes
3 votes
2 answers
3
Tuhin Dutta asked Jan 27, 2018
1,196 views
Concatenation: REG / REC / DCFL / CFL?
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________ a. Regular b. DCFL but not Regular c. CFL but not DCFL d. REC but not DCFL
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________a. R...
User Avatar
0 votes
0 votes
0 answers
4
Sandeep Verma asked Nov 13, 2017
338 views
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
User Avatar
Link Copied!