c语音实现矩阵连乘算法
时间: 2023-11-25 08:51:52 浏览: 31
矩阵连乘问题是指给定n个矩阵{A1, A2, ..., An},其中Ai与Ai+1是可乘的,i=1,2,...,n-1。将它们相乘所需的标量乘法次数与矩阵相乘的顺序有关。矩阵连乘问题的目标是找到一种矩阵相乘的顺序,使得计算它们的标量乘法次数最少。
下面是C语言实现矩阵连乘算法的代码:
```c
#include <stdio.h>
#include <limits.h>
int MatrixChainOrder(int p[], int n) {
int m[n][n];
int i, j, k, L, q;
for (i = 1; i < n; i++)
m[i][i] = 0;
for (L = 2; L < n; L++) {
for (i = 1; i < n - L + 1; i++) {
j = i + L - 1;
m[i][j] = INT_MAX;
for (k = i; k <= j - 1; k++) {
q = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
if (q < m[i][j])
m[i][j] = q;
}
}
}
return m[1][n - 1];
}
int main() {
int arr[] = {30, 35, 15, 5, 10, 20, 25};
int size = sizeof(arr) / sizeof(arr[0]);
printf("Minimum number of multiplications is %d ", MatrixChainOrder(arr, size));
return 0;
}
```