Question

/*
* ADD YOUR STANDARD SUBMISSION INFORMATION HERE
*/

/*
* DESCRIPTION: This function receives an array and the size of the array
* and computes the maximum sum in a contiguous interval of
* in the array.
* PARAM: numbers - an array of unbounded integers
* PARAM: arr_size - the size of the numbers array
* RETURN: the starting index of the interval of the maximum subarray
*
* EXAMPLE: numbers = { -2, -3, 4, -1, -2, 1, 5, -3 }
* function returns: 2
*/
int MaxSubarraySum( int numbers[], int arr_size ) {
// some useful local variables
int i, j;
int max_sum;
int current_sum;
// you may declare any other variables you think may be useful

/* replace the following line with your own solution */
return -1;
}



pl answer this itss reallyyyy urgent ​

Answer 1

Answer:

hdhdhfhdhdhdgudhdhxyxgxuxksixhuxbdidnidndjdndufbdufb

hdjxjdndhdhurb