Project Description:
- Analyze the runtime data of various matrix multiplication algorithms in order to evaluate the theoretical versus empirical time complexity.
- Analyze the theoretical versus empirical time complexity of matrix chain multiplication by comparing sequential versus optimal chain ordering.
Caution
This code is provided for portfolio purposes only. It is not intended for reuse in coursework. Copying any part of this code and submitting it as your own work may be considered plagiarism under your institution’s academic integrity policies. Parts of the code rely on external calculations (spanning seven pages) that are not included in this project folder. Therefore, copying any portion of the code without these references will produce nonsensical results.
Note
All sources can be found in the Matrix Multiplcation folder, within the README.md file.