-
Notifications
You must be signed in to change notification settings - Fork 40
/
Matrix-chain.java
45 lines (41 loc) · 1.07 KB
/
Matrix-chain.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
package matrix_chain;
import java.util.*;
public class Min_mul
{
int matOrder(int array[], int n)
{
int minMul[][] = new int[n][n];
for (int i=1; i<n; i++)
minMul[i][i] = 0;
for (int length=2; length<n; length++)
{
for (int i=1; i<n-length+1; i++)
{
int j = i+length-1;
minMul[i][j] = Integer.MAX_VALUE;
for (int k=i; k<=j-1; k++)
{
int q = minMul[i][k] + minMul[k+1][j] + array[i- 1]*array[k]*array[j];
if (q < minMul[i][j])
minMul[i][j] = q;
}
}
}
return minMul[1][n-1];
}
public static void main(String args[])
{
int n;
System.out.println("Enter size of arrray");
Scanner sc = new Scanner(System.in);
n=sc.nextInt();
int p[] = new int[n];
System.out.println("Enter elements in an array");
for(int i=0;i<n;i++)
{
p[i]= sc.nextInt();
}
Min_mul obj = new Min_mul ();
System.out.println("Minimum number of matrix multiplications:" + obj.matOrder(p, n));
}
}