Matrix chain multiplication: Difference between revisions
m
→{{header|C}}: Minor improvement.
m (→{{header|C}}: Minor improvement.) |
|||
Line 85:
for (i = 0; i < 3; ++i) {
printf("Dims : [");
for (j = 0; j < sizes[i]; ++j) {▼
printf("%d", dims_list[i][j]);▼
if (j < sizes[i] - 1) printf(", "); else printf("]\n");▼
}▼
n = sizes[i];
▲ printf("%d", dims_list[i][j]);
▲ }
optimal_matrix_chain_order(dims_list[i], n);
printf("Order : ");
| |||