Skip to content
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

Jump to bottom

Matrix Chain Multiplication #126

Open
rajbir21-droid opened this issue Oct 3, 2021 · 3 comments · May be fixed by #90
Open

Matrix Chain Multiplication #126

rajbir21-droid opened this issue Oct 3, 2021 · 3 comments · May be fixed by #90

Comments

@rajbir21-droid
Copy link

Description

  • An important algorithm of DP
  • Given a sequence of matrices, find the most efficient way to multiply these matrices together. The efficient way is
    the one that involves the least number of multiplications.
  • The dimensions of the matrices are given in
    an array arr[] of size N (such that N = number of matrices + 1)
    where the ith matrix has the dimensions
    (arr[i-1] x arr[i]).
@rajbir21-droid
Copy link
Author

rajbir21-droid commented Oct 3, 2021 •
edited
Loading

@Hacktoberfestrepo can you please assign me this issue under Hacktoberfest ?. I am ready with my PR
Thank you.

@rajbir21-droid rajbir21-droid linked a pull request Oct 3, 2021 that will close this issue
Open
@Kraken-ops
Copy link

I want to contribute to this issue, please assign me.

@aditikhatri201
Copy link

Please assign me this issue.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Matrix Chain multiplication
3 participants
@rajbir21-droid @Kraken-ops @aditikhatri201