title: Time complexity of a function with a recursive call that divides N by another Number that depends on N
body: <pre><code>void prime_factor(int n){
    if(n&gt;1){
        int i= 2;
        while(n%i!=0){
            i++;
        }
        a[j] = i;
        j++;
            
        prime_factor(n/i);
    }
    
  
  } 
  </code></pre>
  <p>How to calculate the time Complexity of the above algorithm ? I know the loop runs n times (in worst case) but what  will be the complexity of only the recursion part ?</p>