Scribd
Upload
7 views8 pages

DAA Lab File-1

Daa file

Uploaded by

Shivam Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views8 pages

DAA Lab File-1

Daa file

Uploaded by

Shivam Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

PROGRAM-4

Aim: To implement matrix multiplication using Stassen’s algorithm.


Code:
#include <iostream>
#include <cmath>
using namespace std;

const int MAX = 128; // Define maximum matrix size

// Function to add two matrices


void add(int A[MAX][MAX], int B[MAX][MAX], int C[MAX][MAX], int size)
{
for (int i = 0; i < size; i++)
{
for (int j = 0; j < size; j++)
{
C[i][j] = A[i][j] + B[i][j];
}
}
}

// Function to subtract two matrices


void subtract(int A[MAX][MAX], int B[MAX][MAX], int C[MAX][MAX], int size)
{
for (int i = 0; i < size; i++)
{
for (int j = 0; j < size; j++)
{
C[i][j] = A[i][j] - B[i][j];
}
}
}

// Strassen’s matrix multiplication function


void strassen(int A[MAX][MAX], int B[MAX][MAX], int C[MAX][MAX], int size)
{
if (size == 1)
{
C[0][0] = A[0][0] * B[0][0];
return;
}

int newSize = size / 2;


int A11[MAX][MAX], A12[MAX][MAX], A21[MAX][MAX], A22[MAX][MAX];
int B11[MAX][MAX], B12[MAX][MAX], B21[MAX][MAX], B22[MAX][MAX];
int C11[MAX][MAX], C12[MAX][MAX], C21[MAX][MAX], C22[MAX][MAX];
int M1[MAX][MAX], M2[MAX][MAX], M3[MAX][MAX], M4[MAX][MAX];
int M5[MAX][MAX], M6[MAX][MAX], M7[MAX][MAX];
int temp1[MAX][MAX], temp2[MAX][MAX];

// Dividing the matrices into submatrices


for (int i = 0; i < newSize; i++)
{
for (int j = 0; j < newSize; j++)
{
A11[i][j] = A[i][j];
A12[i][j] = A[i][j + newSize];
A21[i][j] = A[i + newSize][j];
A22[i][j] = A[i + newSize][j + newSize];

B11[i][j] = B[i][j];
B12[i][j] = B[i][j + newSize];
B21[i][j] = B[i + newSize][j];
B22[i][j] = B[i + newSize][j + newSize];
}
}

// M1 = (A11 + A22) * (B11 + B22)


add(A11, A22, temp1, newSize);
add(B11, B22, temp2, newSize);
strassen(temp1, temp2, M1, newSize);

// M2 = (A21 + A22) * B11


add(A21, A22, temp1, newSize);
strassen(temp1, B11, M2, newSize);

// M3 = A11 * (B12 - B22)


subtract(B12, B22, temp1, newSize);
strassen(A11, temp1, M3, newSize);

// M4 = A22 * (B21 - B11)


subtract(B21, B11, temp1, newSize);
strassen(A22, temp1, M4, newSize);

// M5 = (A11 + A12) * B22


add(A11, A12, temp1, newSize);
strassen(temp1, B22, M5, newSize);

// M6 = (A21 - A11) * (B11 + B12)


subtract(A21, A11, temp1, newSize);
add(B11, B12, temp2, newSize);
strassen(temp1, temp2, M6, newSize);

// M7 = (A12 - A22) * (B21 + B22)


subtract(A12, A22, temp1, newSize);
add(B21, B22, temp2, newSize);
strassen(temp1, temp2, M7, newSize);

// Calculating C11, C12, C21, C22


add(M1, M4, temp1, newSize);
subtract(temp1, M5, temp2, newSize);
add(temp2, M7, C11, newSize);
add(M3, M5, C12, newSize);

add(M2, M4, C21, newSize);

add(M1, M3, temp1, newSize);


subtract(temp1, M2, temp2, newSize);
add(temp2, M6, C22, newSize);

// Combining the results into a single matrix


for (int i = 0; i < newSize; i++)
{
for (int j = 0; j < newSize; j++)
{
C[i][j] = C11[i][j];
C[i][j + newSize] = C12[i][j];
C[i + newSize][j] = C21[i][j];
C[i + newSize][j + newSize] = C22[i][j];
}
}
}

// Helper function to display a matrix


void displayMatrix(int matrix[MAX][MAX], int size)
{
for (int i = 0; i < size; i++)
{
for (int j = 0; j < size; j++)
{
cout << matrix[i][j] << " ";
}
cout << endl;
}
cout.flush(); // Flush the output to the terminal
}

int main()
{
int n;
cout << "Enter the size of the matrices (must be a power of 2): ";
cin >> n;

int A[MAX][MAX], B[MAX][MAX], C[MAX][MAX];

cout << "Enter elements of matrix A:" << endl;


for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cin >> A[i][j];
}
}
cout << "Enter elements of matrix B:" << endl;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cin >> B[i][j];
}
}

// Initialize the result matrix C with zeros


for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
C[i][j] = 0;
}
}

// Perform Strassen's multiplication


strassen(A, B, C, n);

cout << "Resultant matrix after multiplication using Strassen's algorithm:" <<
endl;
displayMatrix(C, n); // <--- Call displayMatrix to show the result

return 0;
}
Output:

Time Complexity:
 Standard matrix multiplication: 𝑂(n )
 Strassen’s algorithm: 𝑂(n . )

You might also like