矩阵相乘分治算法C语言

矩阵相乘分治算法是一种高效的矩阵相乘方法，它将大的矩阵相乘问题分解为更小的子问题，并通过递归的方式解决。以下是矩阵相乘分治算法的C语言实现：

#include <stdio.h>

// 矩阵相乘函数
void matrixMultiply(int A[][2], int B[][2], int C[][2], int n) {
    if (n == 1) {
        C[0][0] = A[0][0] * B[0][0];
        return;
    }

    int i, j;
    int m = n / 2;

    // 分割矩阵为四个子矩阵
    int A11[m][m], A12[m][m], A21[m][m], A22[m][m];
    int B11[m][m], B12[m][m], B21[m][m], B22[m][m];
    int C11[m][m], C12[m][m], C21[m][m], C22[m][m];

    for (i = 0; i < m; i++) {
        for (j = 0; j < m; j++) {
            A11[i][j] = A[i][j];
            A12[i][j] = A[i][j + m];
            A21[i][j] = A[i + m][j];
            A22[i][j] = A[i + m][j + m];

            B11[i][j] = B[i][j];
            B12[i][j] = B[i][j + m];
            B21[i][j] = B[i + m][j];
            B22[i][j] = B[i + m][j + m];
        }
    }

    // 递归计算四个子矩阵的乘积
    matrixMultiply(A11, B11, C11, m);
    matrixMultiply(A12, B21, C12, m);
    matrixMultiply(A11, B12, C21, m);
    matrixMultiply(A12, B22, C22, m);

    // 合并四个子矩阵的结果
    for (i = 0; i < m; i++) {
        for (j = 0; j < m; j++) {
            C[i][j] = C11[i][j] + C12[i][j];
            C[i][j + m] = C21[i][j] + C22[i][j];
            C[i + m][j] = C11[i][j + m] + C12[i][j + m];
            C[i + m][j + m] = C21[i][j + m] + C22[i][j + m];        }
    }
}

int main() {
    int A[2][2] = {{1, 2}, {3, 4}};
    int B[2][2] = {{5, 6}, {7, 8}};
    int C[2][2];

    matrixMultiply(A, B, C, 2);

    printf("矩阵相乘的结果为：\n");
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            printf("%d ", C[i][j]);
        }
        printf("\n");
    }

    return 0;
}

这段代码实现了一个简单的矩阵相乘分治算法。它将两个2x2的矩阵相乘，并将结果存储在C矩阵中。你可以根据需要修改矩阵的大小和内容。