/*
 * In C, 2-d array in a contiguous layout is row-major, so reading across a row
 * is faster than reading down a column because of caching.
 *
 * Jed Yang
 */
#include <stdio.h>
#define N 1000

int main(void) {
   int matrix[N][N];
   for (int row = 0; row < N; row++) {
      for (int column = 0; column < N; column++) {
         matrix[row][column] = 0;
      }
   }
   int sum = 0;
   for (int k = 0; k < N * 10; k++) {
      for (int row = 0; row < N; row++) {
         for (int column = 0; column < N; column++) {
            sum += matrix[row][column];
         }
      }
   }
   return 0;
}