Assignment: Lesson 6 Wrap-up
Write a function called max_sum that takes v, a row vector of numbers, and n, a positive
integer as inputs. The function needs to find the n consecutive elements of v whose sum is the
largest possible. In other words, if v is [1 2 3 4 5 4 3 2 1] and n is 3, it will find 4 5 and 4
because their sum of 13 is the largest of any 3 consecutive elements of v. If multiple such
sequences exist in v, max_sum returns the first one. The function returns summa, the sum as
the first output argument and index, the index of the first element of the n consecutive ones as
the second output. If the input n is larger than the number of elements of v, the function
returns 0 as the sum and -1 as the index. Here are a few example runs:
function [summa,index]=max_sum(v,n)
z=0;
if n > length(v)
summa=0;
index= -1;
return
else
for ii=1:(length(v)-n+1)
jj=ii+(n-1);
if jj <= length(v)
w=sum(v(ii:jj));
z(ii)=w;
end
end
end
summa=max(z);
b=find(summa==z);
index=min(b);
end
