title: Master's theorem with f(n)=log n
body: <p>For master's theorem <code>T(n) = a*T(n/b) + f(n)</code> I am using 3 cases:</p>
  
  <ol>
  <li>If <code>a*f(n/b) = c*f(n)</code> for some constant <code>c &gt; 1</code> then <code>T(n) = (n^log(b) a)</code></li>
  <li>If <code>a*f(n/b) = f(n)</code> then <code>T(n) = (f(n) log(b) n)</code></li>
  <li>If <code>a*f(n/b) = c*f(n)</code> for some constant <code>c &lt; 1</code> then <code>T(n) = (f(n))</code></li>
  </ol>
  
  <p>But when <code>f(n) = log n</code> or <code>n*log n</code>, the value of <code>c</code> is dependent on value of n. How do I solve the recursive function using master's theorem?</p>