I have an assignment I am not sure with; I have to calculate the time complexity of the following code:

```
int a[][] = new int[m][n];        //O(1)
int w = 0;                        //O(1)
for (int i = 0; i < m; i++)       //O(n)
    for (int j = 0; j <n; j++)    //O(n)
         if (a[i] [j] % 2 == 0)   //O(logn)
         w++;                     //O(1)

```

So from my O estimations I add them up:

O(1) + O(1) + O(n) \* ( O(n) \* ( O(logn) + O(1) / 2 ) )   

O(1) + O(1) + O(n) \* ( O(nlogn) + O(n) / 2 )  

O(1) + O(1) + (O(n2logn) + O(n2) / 2)  

=O(n2logn)

I'm not sure if my train of thought is correct, could somebody help?