Skip to content

Create mcm #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
TARANG0503 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create mcm #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
74 changes: 74 additions & 0 deletions mcm
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,74 @@
#include<bits/stdc++.h>
using namespace std;

void parenthesis(int i,int j,int n,int* brackets,char &symbol)
{
if(i==j)
{
cout<<symbol++;
return;
}
cout<<"(";
parenthesis(i,*((brackets+i*n)+j),n,brackets,symbol);
parenthesis(*((brackets+i*n)+j)+1,j,n,brackets,symbol);
cout<<")";
}

void display(int size,int* arr)
{
for(int i=0;i<size;i++)
{
for(int j=0;j<size;j++)
{
cout<< *((arr+i*size) + j);
}
cout<<endl;
}
}

void order(int p[],int n)
{
int arr[n][n];
int brackets[n][n];
for(int i=1;i<n;i++)
{
arr[i][i]=0;
}
for (int l=2;l<n;l++)
{
for(int i=1;i<n-l+1;i++)
{
int j=i+l-1;
arr[i][j]=INT_MAX;
for(int k=i;k<=j-1;k++)
{
int q=arr[i][k]+arr[k+1][j]+p[i-1]*p[k]*p[j];
if (q<arr[i][j])
{
arr[i][j]=q;
brackets[i][j]=k;
}
}
}
}
char symbol='A';
cout<<"Optimal Parenthesization is: ";
parenthesis(1,n-1,n,(int*) brackets,symbol);
cout<<"\nOptimal Cost is: "<<arr[1][n-1];
display(n,(int*) arr);
display(n,(int*)brackets);
}

int main()
{
int arr[100000];
int n;
cout<<"Enter the number of matrices: ";
cin>>n;
cout<<"Enter the dimensions of matrices: ";
for(int i=0;i<n+1;i++) {
cin>>arr[i];
}
order(arr,n+1);
return 0;
}