/************************************
 *
 *  Matrix Multiplication
 *
 *  Luis Paulo Santos, September 2007
 *
 *  Classic algorithm
 *  Attention to loop nesting order
 * 
 ************************************/

#define MAX_SIDE (1<<10)

// exported functions
void mm (int A[][MAX_SIDE], int B[][MAX_SIDE], int C[][MAX_SIDE], int n);

/*
 * computes C = A * B
 * this is jki order (see Bryant sec 6.6.2)
 */

void mm (int A[][MAX_SIDE], int B[][MAX_SIDE], int C[][MAX_SIDE], int n) {
  int i, j, k, r;
  
  for (k=0 ; k<n ; k++) { // A column, B row
    for (j=0 ; j<n ; j++) { // B & C column
      r = B[k][j];
      for (i=0 ; i<n ; i++) { // A & C row
	C[i][j] += A[i][k] * r;
      }
    }
  }
}