title: Recurrence relation for strange sort
body: <p>I am comfortable with the recurrence relations for the Fibonacci series and for binary search, but I don't know how to find the recurrence relation for this algorithm:</p>
  
  <pre><code>Algorithm strange-sort(A[0,,,,,,n-1])
         if n=2 and A[0]&gt;A[1]
         {
                swap(a[0],a[1])
         }
         else if n&gt;2
         {
                m=ceiling(2n/3)
                strange-sort(A[0.....m-1])
                strange-sort(A[n-m......n-1])
                strange-sort(A[0......m-1]) 
         }
  </code></pre>
  
  <p>How would I get a recurrence relation for this algorithm? What does it solve to?</p>