Question

Design a dynamic programming algorithm for the problem. Define the original problem as a function that takes parameters, and return some results. Define the subproblems Write recursive formula that relates a problem's solution to solutions of smaller subproblems. Finally write out pseudocode for the algorithm (using top-down memoization or bottom-up) Suppose a list Р[L..n] gives the daily stock price of a certain company for a duration of n days, we want to find an optimal day di to buy the stock and then a later day d2 to sell the stock, so that the profit is maximized (ie., P -P(h] is maximized. For example, if P. 20, 10,30, 50, 5, 14 Then we should buy in at day 2, and sell at day 4 to earn profit of 50- 10 per share. (Simply buying at the lowest point and selling at the highest point will not necessarily work, as one have to buy before sell.)

Answer 1

nr If you tros the answer to the til ndas o an fird the Profit CP) for ie2to Rlength do sehum dpcP.lergh