Consider the following nested loops that iterate over the elements of each row in the array `arr`:

```
for(int i = 0; i < arr.length; i++)
    for(int j; j < arr[0].length; j++)
        //some code here involving arr[i][j]

```

Considering that Java does not have true "2D arrays" but rather only arrays of arrays, would this be as efficient as the following nested loops iterating over the columns of the array?

```
for(int j = 0; j < arr[0].length; j++)
    for(int i = 0; i < arr.length; i++)
        //some code involving arr[i][j]

```

Even though `arr[i][j]` is O(1), would I see any difference in the time it takes to do one solution over the other due to Java's implementation of 2D arrays?