title: Time complexity of the following method
body: <p>I'm trying to determine the time complexity of the following method. At the beginning I have three for loops which would yield m^3. I don't know how to determine, what is the time complexity of the recursive call at the end of the method. </p>
  
  <p>Can someone help me with this?</p>
  
  <pre><code>void p(int n, int m) {
      int i,j,k ;
      if (n &gt; 0) {
          for (i=0 ; i &lt; m ; i++)
              for (j=0 ; j &lt; m ; j++)
                  for (k=0 ; k &lt; m ; k++)
                      System.out.println(i+j*k) ;  
          p(n/m, m) ;
      }
   }
  </code></pre>