217 views
0 votes
0 votes
How much time will it take to evaluate this recursive definition using dynamic programming?

(a) O(n)

(b) O(n log n)

(c) O($n^2$ )

(d) O($n^3$ )

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
3
rsansiya111 asked Dec 7, 2021
328 views
The number of possible subsequences in a string of length n are:$n^{2}$$2^{n}$ n!n(n-1)
2 votes
2 votes
1 answer
4
rsansiya111 asked Dec 8, 2021
833 views
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge.What would the worst-case complexity of this ver...