hi every one...........
i'm new in this forum and need ur help please....
i want to write a programme using c++ code,
programme that find the optimal parenthesization of a matrix-chain product, then perform the optimal matrix -chain multiply 4 a sequence of matrices, but the user should enter the number of the matrices and its dimensions.........
plz need ur help guys
thnx .........
>programme that find the optimal parenthesization of a matrix-chain product
Try reading this:-
http://en.wikipedia.org/wiki/Matrix_chain_multiplication
>then perform the optimal matrix -chain multiply 4 a sequence of matrices
Multiplication would go something like this:-
public static void mmult (int rows, int cols,
int[][] m1, int[][] m2, int[][] m3) {
for (int i=0; i<rows; i++) {
for (int j=0; j<cols; j++) {
int val = 0;
for (int k=0; k<cols; k++) {
val += m1[i][k] * m2[k][j];
}
m3[i][j] = val;
}
}
}>but the user should enter the number of the matrices and its dimensions.........
I assume you know what cin is and how to initialise a 2D array?
Given an array of 10 elements, sort the data from index 2 to 6 using insertion sort algorithm.
Write the c/c++ code for Matrix Chain Multiplication Algorithm for at least 5 matrixes.
please solve this in c code.
could anyone be kind enough to provide me with a c++ program on matrix chain multiplication?
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.