Implement (in C) the divide-and-conquer algorithm for the maximum contiguous subsequence problem. Here is a framework that you want to follow to write a complete program :
#include
#include
#include
//function prototypes
struct mcsData mcs(int s[], int lower, int upper, int limit);
struct mcsData straddlingLeftRight(int s[], int mid, int left, int right, int limit);
// A structure data type is used to return all the data about a maximum contiguous subsequence
struct mcsData {
int left;
int right;
int sum;
};
int main(void){
// call mcs from here
}// end of main
// the following function returns the data of an mcs that lies between
// the limits lower and upper, both inclusive
struct mcsData mcs(int s[], int lower, int upper, int limit){
// call straddlingLeftRight from here
}// end of mcs
// the following function finds a maximum straddling sequence and
// returns all its data: sum and limits
struct mcsData straddlingLeftRight(int s[], int mid, int left, int right, int limit){
}// end of straddlingLeftRight