-
-
Notifications
You must be signed in to change notification settings - Fork 158
[Feature Request]: Implementing Strassen's Algorithm in C++ under DSA folder. #3624
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Closed
4 tasks done
Labels
CodeHarborHub - Thanks for creating an issue!
documentation
Improvements or additions to documentation
dsa-solution
Label for solutions related to Data Structures & Algorithms.
gssoc
GirlScript Summer of Code | Contributor
GSSOC'24
GirlScript Summer of Code | Contributor
level1
GirlScript Summer of Code | Contributor's Levels
Comments
@ajay-dhangar sir, kindly assign me this issue under GSSOC'24. |
Hi @sjain1909! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again! |
sjain1970
added a commit
to sjain1970/gssocproject1
that referenced
this issue
Jul 20, 2024
## Fixing Issue codeharborhub#3624 ## Description This pull request adds the implementation of Strassen's algorithm in C++ to the DSA folder. Strassen's algorithm is an efficient algorithm for matrix multiplication that is faster than the conventional matrix multiplication algorithm. It reduces the time complexity from O(n^3) to approximately O(n^2.81), making it suitable for large matrices. ## Type of PR - [ ] Bug fix - [x] Feature enhancement - [ ] Documentation update - [ ] Security enhancement - [ ] Other (specify): _______________ ## Checklist - [x] I have performed a self-review of my code. - [x] I have read and followed the Contribution Guidelines. - [x] I have tested the changes thoroughly before submitting this pull request. - [x] I have provided relevant issue numbers, screenshots, and videos after making the changes. - [x] I have commented my code, particularly in hard-to-understand areas. - [x] I have followed the code style guidelines of this project. - [x] I have checked for any existing open issues that my pull request may address. - [x] I have ensured that my changes do not break any existing functionality. - [x] Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently. - [x] I have read the resources for guidance listed below. - [x] I have followed security best practices in my code changes. ## Additional Context Strassen's algorithm implementation includes: - Efficient matrix multiplication using a divide-and-conquer approach. - Reduction in time complexity compared to the conventional algorithm. - Clear and well-commented code for easy understanding and maintenance. ## Resources for Guidance Please read the following resources before submitting your contribution: - [x] [Code Harbor Hub Community Features](https://www.codeharborhub.live/community/features) - [x] [Markdown Guide](https://www.markdownguide.org/)
18 tasks
sjain1970
added a commit
to sjain1970/gssocproject1
that referenced
this issue
Jul 20, 2024
## Fixing Issue codeharborhub#3624 ## Description This pull request adds the implementation of Strassen's algorithm in C++ to the DSA folder. Strassen's algorithm is an efficient algorithm for matrix multiplication that is faster than the conventional matrix multiplication algorithm. It reduces the time complexity from O(n^3) to approximately O(n^2.81), making it suitable for large matrices. ## Type of PR - [ ] Bug fix - [x] Feature enhancement - [ ] Documentation update - [ ] Security enhancement - [ ] Other (specify): _______________ ## Checklist - [x] I have performed a self-review of my code. - [x] I have read and followed the Contribution Guidelines. - [x] I have tested the changes thoroughly before submitting this pull request. - [x] I have provided relevant issue numbers, screenshots, and videos after making the changes. - [x] I have commented my code, particularly in hard-to-understand areas. - [x] I have followed the code style guidelines of this project. - [x] I have checked for any existing open issues that my pull request may address. - [x] I have ensured that my changes do not break any existing functionality. - [x] Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently. - [x] I have read the resources for guidance listed below. - [x] I have followed security best practices in my code changes. ## Additional Context Strassen's algorithm implementation includes: Efficient matrix multiplication using a divide-and-conquer approach. Reduction in time complexity compared to the conventional algorithm. Clear and well-commented code for easy understanding and maintenance. ## Resources for Guidance Please read the following resources before submitting your contribution: - [x] [Code Harbor Hub Community Features](https://www.codeharborhub.live/community/features) - [x] [Markdown Guide](https://www.markdownguide.org/)
18 tasks
Hello @sjain1909! Your issue #3624 has been closed. Thank you for your contribution! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Labels
CodeHarborHub - Thanks for creating an issue!
documentation
Improvements or additions to documentation
dsa-solution
Label for solutions related to Data Structures & Algorithms.
gssoc
GirlScript Summer of Code | Contributor
GSSOC'24
GirlScript Summer of Code | Contributor
level1
GirlScript Summer of Code | Contributor's Levels
Is there an existing issue for this?
Feature Description
I propose adding the implementation of Strassen's Algorithm in C++ to the DSA (Data Structures and Algorithms) folder. Strassen's Algorithm is an efficient matrix multiplication algorithm that reduces the time complexity compared to the conventional matrix multiplication approach.
Use Case
This feature would enhance the project by providing an efficient algorithm for matrix multiplication, which is a common requirement in various computational tasks. For example, in scenarios involving large-scale data processing or scientific computations, Strassen's Algorithm can significantly improve performance.
Benefits
Implementing Strassen's Algorithm in C++ under the DSA folder will provide a faster matrix multiplication method, significantly reducing computational time for large matrices. This will enhance learning opportunities for developers and students by showcasing advanced matrix multiplication techniques.
Add ScreenShots
No response
Priority
High
Record
The text was updated successfully, but these errors were encountered: