File size: 843 Bytes
c574d3a |
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 46 47 48 49 50 51 52 53 54 55 |
public class MatrixChain{
static int MatrixOrder(int p[], int n)
{
int m[][] = new int[n][n];
int s[][] = new int[n][n];
int i, j, k, d, q;
int min;
// for cost , M[1][1] M[2][2] M[3][3]
for (i = 1; i < n; i++)
m[i][i] = 0;
for(i = 1; i <n; i++)
s[i][i] = 0;
for(d = 1; d<n-1; d++){
for(i = 1; i<n-d; i++){
j = i+d;
min = Integer.MAX_VALUE;
for(k = i; k<=j-1; k++){
//q means cost
q = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j];
if(q<min)
min = q;
s[i][j] =k;
}
m[i][j] = min;
}
}
return m[1][n-1];
}
public static void main(String[] args){
int a[] = new int[] {1,2,3,4};
int size = a.length;
System.out.println(MatrixOrder(a,size));
}
}
|