Given the following recursive function: 1-1 12)-2 (-)-()+( Answer 1-4 1. Write a recursive algorithm compute...

• 

Transcribed Image Text:

Given the following recursive function: 1-1 12)-2 (-)-()+( Answer 1-4 1. Write a recursive algorithm compute f(n). 2. Give a non-recursive optimal algorithm (ve. Dynamic programming algorithm) for computing the function f(n). What is the run time for your algorithm in terms of 0-notation? 3. which is faster the recursive algorithm or the dynamic programming algorithm? Ausly your answe 4. Does dynamic programming always yield to an optimal solution? for all multiples of 2 greater than 2 Given the following recursive function: 1-1 12)-2 (-)-()+( Answer 1-4 1. Write a recursive algorithm compute f(n). 2. Give a non-recursive optimal algorithm (ve. Dynamic programming algorithm) for computing the function f(n). What is the run time for your algorithm in terms of 0-notation? 3. which is faster the recursive algorithm or the dynamic programming algorithm? Ausly your answe 4. Does dynamic programming always yield to an optimal solution? for all multiples of 2 greater than 2

Answer rating: 100% (QA)

1Recursive Algorithm int f... View the full answer