Which loop is faster?


for (I = 0; I < N; I++)
  for (J = 0; J < M; J++)
    update(Xs[I][J]);
or

for (I = 0; I < N; I++)
  for (J = 0; J < M; J++)
    update(Xs[J][I]);
???

>>50
Again, I think you need to write some code instead of just googling shit. Oh wait, you don't have the mental capacity to code! Anyways, here is what I get when I run the loop in Java...

public class Main {

    public static void main(String[] args) {
        int value = 0;
        int size = 5;

        int[][] array = new int[10][10];
        for (int i = 0; i < size; i++)
            array[size / i][size % i] = value;
       
    }
}

run:
Exception in thread "main" java.lang.ArithmeticException: / by zero
        at Main.main(Main.java:10)
Java Result: 1
BUILD SUCCESSFUL (total time: 0 seconds)