I need to write a C++ program which takes an array of size n that has values of

Question

I need to write a C++ program which takes an array of size n that has values of either 0 or 1 and finds the largest subarray of contiguous 1 values in the array. The key is that it must be a divide and conquer approach. Please help!!!

Explanation / Answer

Youhave to do little bit more work on that, but please rate on mywork. Thanks #include #include #include using namespace std; main () {        string inputStr;     int counter=0;     int temp =0;     cout> inputStr;           char strArray[inputStr.length()];     // Returns s[pos]     for ( int pos = 0; pos 0 )                  {                     temp =counter;                                 }                  else counter=0;                  }           }     cout

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.