void add(int a[][MAX_SIZE], int b[][MAX_SIZE], int c[][MAX_SIZE],
int rows, int cols)
{
int i, j; for (i = 0; i < rows; i++) { for (j = 0; j < cols; j++) c[i][j] = a[i][j] + b[i][j]; }
}
void multi(int a[][MAX_SIZE], int b[][MAX_SIZE], int c[][MAX_SIZE],
int rows, int cols)
{
int i, j; int k; for (i = 0; i < MAX_SIZE; i++) { for (j = 0; j < MAX_SIZE; j++) c[i][j] = 0; for (k = 0; k < MAX_SIZE; k++) { c[i][j] += a[i][k] * b[k][j]; } }
}
* 对于第二种乘法就比较简单,对应元素相乘得到的是一个新的矩阵,要求行数和列数必须向等;
void Xmulti(int a[][MAX_SIZE], int b[][MAX_SIZE],
int c[][MAX_SIZE], int rowsa, int colsb, int colsa)
{
int i, j, k;
for (i = 0; i < rowsa; i++)
{
for (j = 0; j < colsb; j++)
{
c[i][j] = 0;
for (k = 0; k < colsa; k++)
c[i][j] += a[i][k] * b[k][j];
}
}
}