title: Time complexity for recursion in for loop
body: <pre><code>func(n){
   if(n == 0){
     //print sth
     return;
   } 
   for(i=1;i&lt;=6;i++){
     func(n-1)
   }
  }   
  </code></pre>
  
  <p>Please help me understand time complexity of above pseudo code.</p>