Breaking News: Grepper is joining You.com. Read the official announcement!

strassen's matrix multiplication algorithm

Attractive Alligator answered on June 14, 2022 Popularity 10/10 Helpfulness 3/10

answer strassen's matrix multiplication algorithm

related strassens matrix multiplication

strassen's matrix multiplication algorithm

Comment

#include <stdio.h>

int main()
{
	int a[2][2],b[2][2],c[2][2],i,j;
	int m1,m2,m3,m4,m5,m6,m7;

	printf("Enter the 4 elements of first matrix: ");
	for(i=0;i<2;i++)
		for(j=0;j<2;j++)
			scanf("%d",&a[i][j]);

	printf("Enter the 4 elements of second matrix: ");
	for(i=0;i<2;i++)
		for(j=0;j<2;j++)
			scanf("%d",&b[i][j]);

	printf("\nThe first matrix is\n");
	for(i=0;i<2;i++)
	{
		printf("\n");
		for(j=0;j<2;j++)
			printf("%d\t",a[i][j]);
	}

	printf("\nThe second matrix is\n");
	for(i=0;i<2;i++)
	{
		printf("\n");
		for(j=0;j<2;j++)
			printf("%d\t",b[i][j]);
	}

	m1= (a[0][0] + a[1][1])*(b[0][0]+b[1][1]);
	m2= (a[1][0]+a[1][1])*b[0][0];
	m3= a[0][0]*(b[0][1]-b[1][1]);
	m4= a[1][1]*(b[1][0]-b[0][0]);
	m5= (a[0][0]+a[0][1])*b[1][1];
	m6= (a[1][0]-a[0][0])*(b[0][0]+b[0][1]);
	m7= (a[0][1]-a[1][1])*(b[1][0]+b[1][1]);

	c[0][0]=m1+m4-m5+m7;
	c[0][1]=m3+m5;
	c[1][0]=m2+m4;
	c[1][1]=m1-m2+m3+m6;

	printf("\nAfter multiplication using \n");
	for(i=0;i<2;i++)
	{
		printf("\n");
		for(j=0;j<2;j++)
			printf("%d\t",c[i][j]);
	}

	return 0;
}

Popularity 10/10 Helpfulness 3/10 Language whatever

Source: www.includehelp.com

Tags: algorithm whatever

Link to this answer
Share Copy Link

Contributed on Jun 14 2022

Attractive Alligator

0 Answers Avg Quality 2/10

Closely Related Answers

strassens matrix multiplication

Comment

-1

#include<stdio.h>
int main(){
  int a[2][2],b[2][2],c[2][2],i,j;
  int m1,m2,m3,m4,m5,m6,m7;

  printf("Enter the 4 elements of first matrix: ");
  for(i=0;i<2;i++)
      for(j=0;j<2;j++)
           scanf("%d",&a[i][j]);

  printf("Enter the 4 elements of second matrix: ");
  for(i=0;i<2;i++)
      for(j=0;j<2;j++)
           scanf("%d",&b[i][j]);

  printf("\nThe first matrix is\n");
  for(i=0;i<2;i++){
      printf("\n");
      for(j=0;j<2;j++)
           printf("%d\t",a[i][j]);
  }

  printf("\nThe second matrix is\n");
  for(i=0;i<2;i++){
      printf("\n");
      for(j=0;j<2;j++)
           printf("%d\t",b[i][j]);
  }

  m1= (a[0][0] + a[1][1])*(b[0][0]+b[1][1]);
  m2= (a[1][0]+a[1][1])*b[0][0];
  m3= a[0][0]*(b[0][1]-b[1][1]);
  m4= a[1][1]*(b[1][0]-b[0][0]);
  m5= (a[0][0]+a[0][1])*b[1][1];
  m6= (a[1][0]-a[0][0])*(b[0][0]+b[0][1]);
  m7= (a[0][1]-a[1][1])*(b[1][0]+b[1][1]);

  c[0][0]=m1+m4-m5+m7;
  c[0][1]=m3+m5;
  c[1][0]=m2+m4;
  c[1][1]=m1-m2+m3+m6;

   printf("\nAfter multiplication using \n");
   for(i=0;i<2;i++){
      printf("\n");
      for(j=0;j<2;j++)
           printf("%d\t",c[i][j]);
   }

   return 0;
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.codeblah.com

Tags: whatever whateve

Link to this answer
Share Copy Link

Contributed on Jun 20 2022

Famous Falcon

0 Answers Avg Quality 2/10

strassen's matrix multiplication algorithm

Contents

More Related Answers

strassen's matrix multiplication algorithm

Closely Related Answers

strassens matrix multiplication

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.