title: What is the time complexity of multiple recursion calls?
body: <p>can anyone explain how we can evaluate time complexity of this function?</p>
  
  <pre><code>int f(int n) 
  { 
      int x,y,z,t; 
      if(n ==1 || n==0) return n; 
      x=f(n/2); 
      y=f(n/3); 
      z=f(n/4); 
      t=x+y+z; 
      if(t&lt;n) return n; 
      return t; 
  }
  </code></pre>