title: Calculate big Theta bound for 2 recursive calls
body: <p>T(m,n) = 2T(m/2,n)+n, assume T(m,n) is constant if either m&lt;2 or n&lt;2
  So what I don't understand is, can this problem be solved using Master Theorem? If so how? If not, is this table correct?</p>
  
  <pre><code>level   # of instances  size    cost of each level  total cost
  0              1        m, n            n                n
  1              2       m/2, n           n               2n
  2              4       m/4, n           n               4n
  i             2^i    m/(2^i), n         n             2^i * n
  k              m        1, n            n               n*m
  </code></pre>
  
  <p>Thanks!</p>