backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-11-04 23:04:44 +08:00
Code Issues Projects Releases Wiki Activity

Fix windows error

Browse Source
This commit is contained in:
Ashish Daulatabad
2022-11-15 10:58:34 +05:30
parent 02439b57d8
commit 66eca89522
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
divide_and_conquer/strassen_matrix_multiplication.cpp
View File

@@ -230,7 +230,8 @@ class Matrix {
bool>::type>
inline Matrix operator*(const Matrix<Number> &other) const {
assert(_mat[0].size() == other._mat.size());
auto [row, col] = this->size();
auto size = this->size();
const size_t row = size.first, col = size.second;
// Main condition for applying strassen's method:
// 1: matrix should be a square matrix
// 2: matrix should be of even size (mat.size() % 2 == 0)
@@ -397,17 +398,16 @@ class Matrix {
void test() {
const size_t s = 1024;
auto matrix_demo = Matrix<size_t>(s, s);
auto [row, col] = matrix_demo.size();
for (size_t i = 0; i < row; ++i) {
for (size_t j = 0; j < col; ++j) {
for (size_t i = 0; i < s; ++i) {
for (size_t j = 0; j < s; ++j) {
matrix_demo[i][j] = i + j;
}
}
auto matrix_demo2 = Matrix<size_t>(s, s);
std::tie(row, col) = matrix_demo2.size();
for (size_t i = 0; i < row; ++i) {
for (size_t j = 0; j < col; ++j) {
for (size_t i = 0; i < s; ++i) {
for (size_t j = 0; j < s; ++j) {
matrix_demo2[i][j] = 2 + i + j;
}
}