13.28 Pointers - Ex4

General Description

You are given an array that may contain both positive and negative integers. Your goal is to find the sum of any contiguous subarray of numbers which has the largest sum.

For example, if the given array is {6, -2, 1, 3, 4, 6, -2, -6, -4, -7}, then the maximum subarray sum is 18 (see highlighted elements).

Tasks

Read an integer from the user that represents how many elements you will allocate in memory as an array. You can store this in a variable called N.

Create an array of N elements.

Then you will read N integers from the user given to you in the following format and store them in the array:

Write a function call findBest that receives the array, the size of the array and returns the maximum subarray sum.

Print out the return value from your function using the format "%d". Do this by calling your function in the main function.

Example 1:

When the input is:

10 6 -2 1 3 4 6 -2 -6 -4 -7 

The output is:

18

Example 2:

When the input is:

9

-2 6 6 -2 7 -3 -6 -3 -8?

The output is:

17