title: How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
body: <p>I know how to do recurrence relations for algorithms that only call itself once, but I'm not sure how to do something that calls itself multiple times in one occurrence.</p>
  
  <p>For example:</p>
  
  <pre><code>T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
  </code></pre>