Overview
Implement Strassen’s Matrix Multiplication algorithm in this repository. Strassen’s algorithm is a fast matrix multiplication technique useful for multiplying two matrices, typically more efficient than the standard cubic algorithm for large matrices.
Details
- Create a function/class to perform Strassen’s multiplication for two square matrices.
- Support matrices where the dimension is a power of 2 (or pad matrices if necessary).
- Include both recursive and base-case multiplication in the implementation.
- Provide a sample input/output in the code comments or README.
- Write clear documentation and comments.
- Add test cases to validate correctness and compare with standard matrix multiplication.
References
Motivation
This is a classic example of divide-and-conquer in algorithms. It will be a valuable addition for those learning about advanced algorithms.