Scribd
Upload
52 views2 pages

Practical 5

The document discusses an algorithm to find the most efficient way to multiply a sequence of matrices by using dynamic programming. It explains building a 2D matrix to store solutions to subproblems and recursively calculating the minimum number of multiplications needed from the dimensions of the matrices.

Uploaded by

Worst Edits
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
52 views2 pages

Practical 5

The document discusses an algorithm to find the most efficient way to multiply a sequence of matrices by using dynamic programming. It explains building a 2D matrix to store solutions to subproblems and recursively calculating the minimum number of multiplications needed from the dimensions of the matrices.

Uploaded by

Worst Edits
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

210170107508 Analysis and Design of Algorithm Batch: H3

Practical – 5
AIM : Implementation of matrix chain multiplication using dynamic
programming.

Introduction :
Given the dimension of a sequence of matrices in an array arr[], where the dimension of the i
th matrix is (arr[i-1] * arr[i]), the task is to find the most efficient way to multiply these
matrices together such that the total number of element multiplications is minimum.
Input: arr[] = {40, 20, 30, 10, 30}
Output: 26000
Explanation: There are 4 matrices of dimensions 40×20, 20×30, 30×10, 10×30.
Let the input 4 matrices be A, B, C and D.
The minimum number of multiplications are obtained by putting parenthesis in following
way (A(BC))D.
The minimum is 20*30*10 + 40*20*10 + 40*10*30

Dynamic Programming Approach:


Follow the below steps to solve the problem:
 Build a matrix dp[][] of size N*N for memoization purposes.
 Use the same recursive call as done in the above approach:
 When we find a range (i, j) for which the value is already calculated, return the
minimum value for that range (i.e., dp[i][j]).
 Otherwise, perform the recursive calls as mentioned earlier.
 The value stored at dp[0][N-1] is the required answer.
Analysis:
Time Complexity: O(N 3 ) Auxiliary Space: O(N 2 ) (ignoring recursion stack
space)

Code :
public class Main {
static int MatrixChainOrder(int p[], int i, int j) {
if (i == j)
return 0;
1
210170107508 Analysis and Design of Algorithm Batch: H3

int min = Integer.MAX_VALUE;


for (int k = i; k < j; k++) {
int count = MatrixChainOrder(p, i, k) + MatrixChainOrder(p, k + 1, j) + p[i - 1] * p[k] *
p[j];
if (count < min)
min = count;
}
return min;
}
public static void main(String args[]){
int arr[] = { 1, 2, 3, 4, 3 };
int N = arr.length;
System.out.println(“Minimum number of multiplications is " + MatrixChainOrder(arr, 1, N
- 1));
}
}

Output :

You might also like