- Iterative Matrix Multiplication Implementation ( Time Complexity : O(n3) )
- Divide and Conquer Matrix Multiplication ( Time Complexity : O(n3) )
- Strassen's Divide and Conquer Matrix Multiplication ( Time Complexity : O(n2.807) )
- 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