title: recurrence relation on a Merge Sort algorithm
body: <p>The question is :</p>
  
  <p>UNBALANCED MERGE SORT
  is a sorting algorithm, which is a modified version of
  the standard MERGE SORT
  algorithm. The only difference is that instead of dividing
  the input into 2 equal parts in each stage, we divide it into two unequal parts – the first
  2/5 of the input, and the other 3/5.</p>
  
  <p>a. Write the recurrence relation for the worst case time complexity of the
  UNBALANCED MERGE SORT
  algorithm.</p>
  
  <p>b. What is the worst case time complexity of the UNBALANCEDMERGESORT
  algorithm? Solve the recurrence relation from the previous section.</p>
  
  <p>So i'm thinkin the recurrence relation is : T(n) &lt;= T(2n/5) + T(3n/5) + dn.
  Not sure how to solve it.
  Thanks in advance.</p>