[New Algorithm: <Matrix chain multiplication> Add Matrix chain multiplication in dynamic programming

[shuvojitss]

Idea Title

Matrix Chain Multiplication

Idea Description

Matrix Chain Multiplication

Name

[New Algorithm] 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]).

Input:

• No. of Matrices
• The dimensions of matrices (n+1 integers where nth matrix has dimensions arr[i] x arr[i+1]):

Output:

Minimum number of multiplications required for the matrices multiplication

Potential Benefits

• Improves user experience
• Enhances learning
• Adds a new feature
• Improves code quality
• Other

Implementation Suggestions (Optional)

No response

[github-actions]

👋 Hi @shuvojitss! Thanks for opening this issue. We appreciate your contribution to the Algo project. Our team will review it soon.