The program accepts two n*n matrices, then implements Strassen Algorithm to calculate the product of those two matrices in O(n^2.80) time complexity instead of O(n^3).

Describe your change:

Added a program to implement Strassen Algorithm for matrix multiplication in O(2^2.80) time complexity.
Wikipedia reference to Strassen Algorithm: https://en.wikipedia.org/wiki/Strassen_algorithm

• Add an algorithm?

References

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.