title: Setting up and solving a recurrence relation for a recursive function?
body: <p>I am in the process of learning java recurrence but am stuck on the following question.</p>
  
  <pre><code>void f(int n) {
      if (n&lt;=1) return;
      f(n/2);
      System.out.writeln("still continuing...");
      f(n/2);
      f(n/2);
  }
  </code></pre>
  
  <p>I have two questions about this.</p>
  
  <ol>
  <li><p>if we say that T(n) is the number of lines that the program prints and n is the input, what would be the recurrence formula for T(n)?</p></li>
  <li><p>How do I go about solving the recurrence from question 1 without using master theorem?</p></li>
  </ol>
  
  <p>cheers</p>