AshiqAR / Matrix-Multiplication-Algorithms

Implementations of some of the Matrix Multiplication Algorithms

Matrix-Multiplication-Algorithms

1. Iterative Matrix Multiplication Implementation ( Time Complexity : O(n³) )
2. Divide and Conquer Matrix Multiplication ( Time Complexity : O(n³) )
3. Strassen's Divide and Conquer Matrix Multiplication ( Time Complexity : O(n^2.807) )

Test File

• The test file contains all the algorithm implementations in one file
• Compare the perfomance of each algorithms for a range of values of n
• The average Runtime and standard deviation of the runtimes for each value of n for each algorithm can be obtained