Question

using MATLAB

Write a function which will take two inputs: an array ? and an integer ?.

Here, 1 <= ? < ?????h(?). The objective is to find a contiguous subarray of length ? with the largest sum, within the array ?. The output of the function will be

that largest sum.

For example, x = [1 2 -1 3], and k =2. Then there are 3 possible contiguous subarrays.

1st subarray : [ 1 2], sum = 3 2nd subarray : [ 2 -1 ], sum = 1 3rd subarray : [ -1 3], sum = 2

Then output of the function ?(?, ?) = 3

Answer 1

MATLAB Script:

close all
clear
clc

fprintf('Example 1\n------------------------------------\n')
x = [1 2 -1 3]
k = 2
s = max_sum(x, k);
fprintf('Result: '), disp(s)

fprintf('\nExample 2\n------------------------------------\n')
x = [1 2 -1 3 5 3 6 -1 2 3 6]
k = 4
s = max_sum(x, k);
fprintf('Result: '), disp(s)

function s = max_sum(x, k)
s = [];
for i = 1:length(x)-k+1
s = [s sum(x([i:i+k-1]))]; % List the sums of all sub-arrays of length k
end
s = max(s);
end

Output:

Example 1
------------------------------------
x =
1 2 -1 3
k =
2
Result: 3

Example 2
------------------------------------
x =
1 2 -1 3 5 3 6 -1 2 3 6
k =
4
Result: 17