title: Time complexity of 2 nested for loops
body: <p>This question is for revision from a past test paper
  just wondering if i am doing it right</p>
  
  <p>work out the time complexity T(n) of the following piece of code in terms of number of operations for a given integer n:</p>
  
  <pre><code>    for ( int i = 1; i &lt; n*n*n; i *= n ) {
        for ( int j = 0; j &lt; n; j += 2 ) {
           for ( int k = 1; k &lt; n; k *= 3 ) {
           // constant number C of elementary operations
           }
         }
       }
  </code></pre>
  
  <p>so far i've come up with n^3 * n * log n = O( n^4 log n)</p>