Question

Write program(Only in C, no C++) as follow. With comment

Algorithm 1 MaxSubSeqDivideNConquer(S[..r] Input: A sequence, S of r - 1 integers Output: The sum, start and end of a maximum contiguous subsequence S[start..end 1: if ( r then (S 0) then if 2: return 0, -1, 0 3: else 4: return 5: end if 6: 7: else mid (r/2 (таzSum,mid, start, end) (таzSummid+1,r, start,end,) (marSuffix, left.Index) (maxPrefia, rightIndea) 8: MaxSubSeq DivideNConquer (S[l, mid) MarSubSeq DivideNConquer (S[mid1, r) marSuffix (S[l, mid) maxPrefix (S[mid 1, r 9: 10: 11 12: 13: marSummid+1,r) 0 and (maxSum, mid - (maxSuffix if (marSummid max Prefix))20 then 14: Return max contiguous sequence from left half (таzSum, starti., end) return 15: 1 end if 16: 17: 0 and (marSummid+ 1,r -(marSuffix + if (mazSummid+1,r - marSum1,mid) mar Prefix))20 then 18: return (maxSum, start,, end,) end if Return max contiguous sequence from right half 19: 20: 21: if ((mаzSuffir+ mazPrefiz) — таzSum,mia) > 0 and ((mаzSuffiz + mazPrefir) — marSum,mid+1,r) 20 then return (marSuffix+ maxPrefix, leftInder, rightIndex) 22: Return straddling 23: sequence end if 24:

Answer 1

Program in c/c++:

#include <stdio.h>
#include <limits.h>

// to get max from two varibale
int ToFindMaximum(int a, int b) { return (a > b)? a : b; }

// to get max from three varibale
int ToFindMaximum(int a, int b, int c) { return ToFindMaximum(ToFindMaximum(a, b), c); }

// to get max from araay
int ToFindMaximumCrossingSum(int arr[], int l, int m, int h)
{
// Include elements on left of mid.
int sum = 0;
int Sum_Of_Left= INT_MIN;
for (int i = m; i >= l; i--)
{
sum = sum + arr[i];
if (sum > Sum_Of_Left)
Sum_Of_Left= sum;
}

// Include elements on right of mid
sum = 0;
int Sum_Of_Right = INT_MIN;
for (int i = m+1; i <= h; i++)
{
sum = sum + arr[i];
if (sum > Sum_Of_Right)
Sum_Of_Right = sum;
}

// Return sum of elements on left and right of mid
return Sum_Of_Left+ Sum_Of_Right;
}

// Returns sum of Maximum sum subarray in aa[l..h]
int ToFindMaximumSubArraySum(int arr[], int low, int high)
{

if (low == high)
return arr[low];

int middle = (low + high)/2;
//divide aray
return ToFindMaximum(ToFindMaximumSubArraySum(arr, low, middle),
ToFindMaximumSubArraySum(arr, middle+1, high),
ToFindMaximumCrossingSum(arr, low, middle, high));
}

//drive class
int main()
{
int arraryint[] = {5, 9, 4, 5, 7};
int n = sizeof(arraryint)/sizeof(arraryint[0]);
int Maximum_sum = ToFindMaximumSubArraySum(arraryint, 0, n-1);
printf("maximum contiguous subsequence sum is %d ", Maximum_sum);
getchar();
return 0;
}

output

maximum contiguous subsequence sum is 30