title: Analysis of “Finding Maximum Sum of Subsequent Elements” algorithm
body: <p>If possible, I would like someone to give an analytic explanation of the algorithm.</p>
  
  <p>For example, given the sequence </p>
  
  <pre><code>-2, 4, -1, 3, 5, -6, 1, 2 
  </code></pre>
  
  <p>the maximum subsequence sum would be </p>
  
  <pre><code>4 + -1 + 3 + 5 = 11
  </code></pre>
  
  <p>This algorithm I am reffering to is an divide and cconquer type algorithm.</p>
  
  <p>The algorithm is <em>O(nlogn)</em> complexity.</p>
  
  <p>Actually i seek to see an example of all the steps that this algorithm produces. The above sequence could be used for the example. </p>