title: Big O complexity of loop with two independent inner loops
body: <p>I have a function that depends on three variables, <code>T</code>, <code>N</code>, and <code>M</code>. The loop is the following:</p>
  
  <pre><code>for each t from 0 to T {
      for each n from 0 to N {
           process(n,t);
      }
      for each m from 0 to M {
           process(m,t);
      }
  }
  </code></pre>
  
  <p>What would be the big-O run-time complexity of this? I am thinking <code>O(T*Max(n,m))</code> but is this standard? Thanks!</p>