With 1.7 million freelancers, we'll match you with the perfect talent.
The client has made the following changes to the job.
Client prefers freelancers from:
You are still able to submit a proposal for this job.
The client prefers freelancers from
a different location.
I got another job and since you did a great job last time. I wanted to ask you again if you could help me out. Its pretty much the same problem but with dynamic programming instead. Specifically:
Solve the same problem as in the previous job using dynamic programming. The
need for a dierent solution arises because the greedy method does not guarantee the optimal
In addition to the program, you should turn in written answers (with your program) to
the following questions:
1. How does the principal of optimality apply?
2. What is the recurrence relation used in solving this problem?
3. How does the table of partial solutions look like? How to construct such a table?
Sign in or Register to see more