矩阵乘法 的C程序实现1——数据结构与算法基础(青岛大学-王卓)绪论
#include<stdio.h>
#include<stdlib.h>
#define N 3
void initMatrix(int *,int ,int );
void mulMatrix(int*, int*,int*, int);
void showMatrix(int* a, int n);
int main()
{
int a[N][N];
int b[N][N];
int c[N][N];
initMatrix(a, N, 1);
initMatrix(b, N, 5);
mulMatrix(c, a, b, N);
showMatrix(a, N);
showMatrix(b, N);
showMatrix(c, N);
system("pause");
return 0;
}
void initMatrix(int *a, int n,int starti)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
a[i*n+j] = starti + i + j;
}
}
}
void mulMatrix(int* c, int* a, int* b, int n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
c[i * n + j] = 0;
for (int k = 0; k < n; k++)
{
c[i * n + j] = c[i * n + j] + a[i * n + k] * b[k * n + j];
}
}
}
}
void showMatrix(int* a, int n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
printf("%d\t", a[i * n + j]);
}
printf("\n");
}
printf("\n");
}

