Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Which loop is faster?

Name: Anonymous 2012-01-16 8:59



for (I = 0; I < N; I++)

  for (J = 0; J < M; J++)

    update(Xs[I][J]);



for (I = 0; I < N; I++)

  for (J = 0; J < M; J++)

    update(Xs[J][I]);

???

Name: Anonymous 2012-01-16 13:25

Aspies fucking TOLD.

http://java.sun.com/docs/books/jls/third_edition/html/expressions.html#15.17.3

Remainder operator

In computing, the modulo operation finds the remainder of division of one number by another.

Name: Anonymous 2012-01-16 13:26

Guys
http://java.sun.com/docs/books/jls/third_edition/html/expressions.html#15.17.3
it's the remainder operator,
What we understand by modulo division.

Name: Anonymous 2012-01-16 13:27

The binary % operator is said to yield the remainder of its operands from an implied division; the left-hand operand is the dividend and the right-hand operand is the divisor.

Newer Posts

Which loop is faster?

1 Name: Anonymous 2012-01-16 8:59

81 Name: Anonymous 2012-01-16 13:25

82 Name: Anonymous 2012-01-16 13:26

83 Name: Anonymous 2012-01-16 13:27

Name: Anonymous 2012-01-16 8:59

Name: Anonymous 2012-01-16 13:25

Name: Anonymous 2012-01-16 13:26

Name: Anonymous 2012-01-16 13:27