The Wayback Machine - https://web.archive.org/web/20201019102538/https://github.com/TheAlgorithms/Python/issues/3486
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.

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

Added chain matrix multipliaction (problem) in the dynamic programming section #3486

Open
Nyctophiliac1918 opened this issue Oct 18, 2020 · 0 comments

Comments

@Nyctophiliac1918
Copy link

@Nyctophiliac1918 Nyctophiliac1918 commented Oct 18, 2020

This program will return the minimum number of multiplications needed to multiply the chain of matrices. Matrices A, B, C, D can be multiplied in ways such as (ABC)D, (AB)(CD), A(BC)D, etc. So, for finding the method with the minimum number of multiplications, this functions proves to be useful.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
1 participant
You can’t perform that action at this time.