The code determines the optimum number of operations to compute the product of matrices. The problem is obtained from the CLRS book, Introduction to Algorithms.
mndxpnsn/matrix-chain-mult
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Determining the optimum number of operations of a product of matrices using dynamic programming.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published