[Code Addition Request]: Strassen's Matrix Multiplication in divide and conquer #943
Open
3 tasks done
Labels
Contributor
Denotes issues or PRs submitted by contributors to acknowledge their participation.
gssoc-ext
hacktoberfest
level1
Status: Assigned
Indicates an issue has been assigned to a contributor.
Have you completed your first issue?
Guidelines
Latest Merged PR Link
#853
Project Description
Idea Title
Strassen's Matrix Multiplication
Idea Description
Name:
[NEW ALGORITHM]
Given 2 matrix, multiply them such that the time complexity of the calculation is O(n^2.81). You can use divide and conque approach to achieve the time complexity.About:
Implementation of Divide and Conquer Approach.
Input:
Enter both the matrices
Output:
Resultant matrix.
Full Name
Shuvojit Samanta
Participant Role
GSSOC
The text was updated successfully, but these errors were encountered: