I wrote it as pseudo code, but not with dynamic programming
sum(A,n): for all n
if n=0, max = 0 else
if n=1, max=A[1] else
max = sum(A[n] + sum(A,n-2),...
Type: Posts; User: urpis
I wrote it as pseudo code, but not with dynamic programming
sum(A,n): for all n
if n=0, max = 0 else
if n=1, max=A[1] else
max = sum(A[n] + sum(A,n-2),...
Hi, ı have some problem with my dynamic programming assignment. I can do it by using c. But ı don't know how to use dynamic programming.
In the assignment we are asking to find the maximum sequence...