Open shuvojitss opened 1 day ago
🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.
Feel free to join our community on Discord to discuss more!
@UTSAVS26 pls assign this issue to me under gssoc-ext
@UTSAVS26 pls assign this issue to me under gssoc-ext
You can raise new issue.
Have you completed your first issue?
Guidelines
Latest Merged PR Link
https://github.com/UTSAVS26/PyVerse/pull/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