DO I = 1, N-1 A(I) = A(I) + A(I+1) ENDDO
DO I = 3, N A(I) = A(I-1) + A(I-2) ENDDO
DO I = 1, N A(J(I)) = B(I) ENDDOetwa: J(28) = J(42) = 17
void f(double a[], double b[], int n) { int i; for (i=0; i<n; i++) { a[i] = b[i]; } } double a[100]; f(a+1, a, 99);
for (i=0; i<n; i++) { if (b[i] < 0.0) break; a[i] = b[i]; }
Compiler parallelisiert automatisch:
X(1:M) = X(2:M+1)
Fortran90: keine LCDs!
DO I = 1, 1000 S = A(I) + B(I) C(I) = 2 * S ENDDO
SUM = 0.0 DO I = 1, 4711 SUM = SUM + A(I) ENDDO