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

Which loop is faster?



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]);

???

>>97
If the dividend is an infinity, or the divisor is a zero, or both, the result is NaN.
It's still not divisble by zero FYI, but atleast defined.

Newer Posts