• retagged by
617 views

1 Answer

0 0 votes
yes!
Position:
Show:

Related questions

3 3 votes
0 0 answers
1.1k
1.1k views
junk_mayavi asked Jan 10, 2018
1,129 views
Select the wrong statement from the following given options. <ol style="list-style-type:upper-alpha"><li Dynamic programming is applicable when subproblems are not indep...
2 2 votes
2 answers 2 answers
1.3k
1.3k views
Manasi Srivastava asked Oct 9, 2017
1,297 views
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can...
2 2 votes
1 1 answer
844
844 views
Supremo asked Jan 19, 2017
844 views
Consider the following recursive function which is used by dynamic programming.\[T(n)=\left\{\begin{array}{l}0: \text { if } n \leq 1 \\1 ; \text { if } n=1 \\T(n-2)+T(n-...
1 1 vote
2 answers 2 answers
1.2k
1.2k views
A_i_$_h asked Jul 25, 2017
1,191 views
fib(n){if(n==0)return 0;if(n==1)return 1;return(fib(n-1) + fib(n-2));}for fib(4) the number of function calls by dynamic programmming is 7and without dynamic programming ...