Regarding code logic

#1

how to calulate max suffix aaray in left part and max prefix sum in the right part . has it been explained how to code for that part in any of the videos in whole course bcz i have done only stl ,recursion,divide & conquer lecture videos

#2

only approach is given to you
code you have write at your own

i will give you a simple hint

int maxSubArraySum( int arr[], int l, int h)

{

// Base Case: Only one element

if (l == h)

return arr[l];

// Find middle point

int m = (l + h)/2;

/* Return maximum of following three possible cases

a) Maximum subarray sum in left half

b) Maximum subarray sum in right half

c) Maximum subarray sum such that the subarray crosses the midpoint */

return max(maxSubArraySum(arr, l, m),

maxSubArraySum(arr, m+1, h),

maxCrossingSum(arr, l, m, h));

}

as this is recursive algorithm so

will be calculated by recursion

now you have to write one function only

i hope this help