Cantankerousshop owner program in java
Answers
Answered by
44
import java.util.*;
public class OBST
{
static int optCost(int freq[],int i,int j)
{
if(j{
return 0;
}
if(j==i)
{
return freq[i];
}
int fsum=sum(freq,i,j);
int min=Integer.MAX_VALUE;
for(int r=i;r<=j;r++)
{
int cost=optCost(freq,i,r-1)+optCost(freq,r+1,j);
if(cost{
min=cost;
}
return min+fsum;
}
static int optimalSearchTree(int keys[],int freq[],int n)
{
return optCost(freq,0,n-1);
}
static int sum(int freq[],int i,int j)
{
int s=0;
for(int k=i;k<=j;k++)
{
s+=freq[k];
return s;
}
public static void main(String args[])
{
int keys[]={10,12,20};
int freq[]={34,8,50};
int n=keys.length;
System.out.println("cost of optimal BST is"+optimalSearchTree(keys,freq,n));
}
}
Similar questions