两个N×N矩阵相乘的算法。
#include<stdio.h> #define n 3 int main() { int i, j, k; int a[n][n] = { 1,2,3,4,5,6,7,8,9 }, b[n][n] = { 1,2,3,4,5,6,7,8,9 }, c[n][n] = { 0 }; for (i = 0; i < n; ++i) //i是数组a的行 { for (j = 0; j < n; ++j) //j是数组b的列,k是数组a的列 { c[i][j] = 0; for (k = 0; k < n; ++k)// k是数组b的行 { c[i][j] += a[i][k] * b[k][j]; } } } for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { printf("%-5d ", c[i][j]); } printf("\n"); } return 0; }