technojam/Ultimate_Algorithms_Repository

Strassen’s Matrix Multiplication

Open

#306 opened on Oct 14, 2020

View on GitHub
 (1 comment) (0 reactions) (0 assignees)C++ (165 forks)auto 404
hacktoberfest

Repository metrics

Stars
 (87 stars)
PR merge metrics
 (PR metrics pending)

Description

Title or Name of the Algorithm:- Strassen’s Matrix Multiplication

Describe the algorithm:- In the divide and conquer method of multipying matrices , the main component for high time complexity is 8 recursive calls. The idea of Strassen’s method is to reduce the number of recursive calls to 7.

Contributor guide

Research direction
Study Strassen's algorithm to understand how to reduce recursive calls from 8 to 7. Implement a function that multiplies two matrices using this method, handling matrix size constraints (e.g., padding to power of 2). Consider edge cases like non square matrices or sizes that are not powers of 2.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++Matrix MultiplicationDivide and Conquer
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
40