title: Finding largest sum in an unsorted array using divide and conquer algorithm
body: <p>I have a sequence of n real numbers stored in a array, A[1], A[2], …, A[n]. I am trying to implement a divide and conquer algorithm to find two numbers A[i] and A[j], where i &lt; j, such that A[i] ≤ A[j] and their sum is the largest. </p>
  
  <p>For eg. {2, 5, 9, 3, -2, 7} will give the output of 14 (5+9, not 16=9+7). Can anyone suggest me some ideas on how to do it?</p>
  
  <p>Thanks in advance.</p>