title: Unsure if my complexity analysis is correct
body: <p>Attempting to find a Big-O estimation of this code chunk:</p>
  
  <pre><code>int a[][] = new int[m][n];
  int w = 0;
  for (int i = 0; i&lt;m; i++) {
      for(int j = 0; j&lt;n; j++) {
          if ( a[i][j]%2 == 0) {
              w++;
          }
      }
  }
  </code></pre>
  
  <p>I made an esimation and simplified: O(m)O(n)O(1) => O(mn)</p>
  
  <p>It looks like all cases will be O(mn) because it doesn't matter if the O(1) operation executes or not, is this correct? Or are there best/worst/average cases?</p>
  
  <p>Appreciate any insight!</p>
  
  <p>Thank you</p>