strassen in c language.
来源:互联网 发布:kbar软件 编辑:程序博客网 时间:2024/05/21 21:45
#include<stdio.h>
#define N 8
void input(int n,int p[N][N])
{
int i,j;
for(i=0;i<n;i++)
{
printf("please input the %d line:/n",i+1);
for(j=0;j<n;j++)
{
scanf("%d",&p[i][j]);
}
}
}
void output(int n,int p[N][N])
{
int i,j;
for(i=0;i<n;i++)
{
printf("/n");
for(j=0;j<n;j++)
{
printf("%d",p[i][j]);
}
}
}
void MATRIX_ADD(int n,int X[][N],int Y[][N],int Z[][N])
{
int i,j;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
Z[i][j]=X[i][j]+Y[i][j];
}
void MATRIX_SUB(int n,int X[][N],int Y[][N],int Z[][N])
{
int i,j;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
Z[i][j]=X[i][j]-Y[i][j];
}
void MATRIX_MULTIPLY(int A[][N],int B[][N],int C[][N])
{
int i,j,t;
for(i=0;i<2;i++)
for(j=0;j<2;j++)
{
C[i][j]=0;
for(t=0;t<2;t++)
C[i][j]=C[i][j]+A[i][t]*B[t][j];
}
}
void STRASSEN(int n,int A[][N],int B[][N],int C[][N])
{
int i,j;
int A11[N][N],A12[N][N],A21[N][N],A22[N][N];
int B11[N][N],B12[N][N],B21[N][N],B22[N][N];
int C11[N][N],C12[N][N],C21[N][N],C22[N][N];
int M1[N][N],M2[N][N],M3[N][N],M4[N][N],M5[N][N],M6[N][N],M7[N][N];
int AA[N][N],BB[N][N],MM1[N][N],MM2[N][N];
if(n==2)
MATRIX_MULTIPLY(A,B,C);
else
{
for(i=0;i<n/2;i++)
for(j=0;j<n/2;j++)
{
A11[i][j]=A[i][j];
A12[i][j]=A[i][j+n/2];
A21[i][j]=A[i+n/2][j];
A22[i][j]=A[i+n/2][j+n/2];
B11[i][j]=B[i][j];
B12[i][j]=B[i][j+n/2];
B21[i][j]=B[i+n/2][j];
B22[i][j]=B[i+n/2][j+n/2];
}
MATRIX_SUB(n/2,B12,B22,BB);
STRASSEN(n/2,A11,BB,M1);
MATRIX_ADD(n/2,A11,A12,AA);
STRASSEN(n/2,AA,B22,M2);
MATRIX_ADD(n/2,A21,A22,AA);
STRASSEN(n/2,AA,B11,M3);
MATRIX_SUB(n/2,B21,B11,BB);
STRASSEN(n/2,A22,BB,M4);
MATRIX_ADD(n/2,A11,A22,AA);
MATRIX_ADD(n/2,B11,B22,BB);
STRASSEN(n/2,AA,BB,M5);
MATRIX_SUB(n/2,A12,A22,AA);
MATRIX_ADD(n/2,B21,B22,BB);
STRASSEN(n/2,AA,BB,M6);
MATRIX_SUB(n/2,A11,A21,AA);
MATRIX_ADD(n/2,B11,B12,BB);
STRASSEN(n/2,AA,BB,M7);
MATRIX_ADD(n/2,M5,M4,MM1);
MATRIX_SUB(n/2,M6,M2,MM2);
MATRIX_ADD(n/2,MM1,MM2,C11);
MATRIX_ADD(n/2,M1,M2,C12);
MATRIX_ADD(n/2,M3,M4,C21);
MATRIX_ADD(n/2,M3,M7,MM2);
MATRIX_ADD(n/2,M5,M1,MM1);
MATRIX_SUB(n/2,MM1,MM2,C22);
for(i=0;i<n/2;i++)
for(j=0;j<n/2;j++)
{
C[i][j]=C11[i][j];
C[i][j+n/2]=C12[i][j];
C[i+n/2][j]=C21[i][j];
C[i+n/2][j+n/2]=C22[i][j];
}
}
}
void main()
{
int A[N][N],B[N][N],C[N][N];
printf("please input A:");
printf("/n");
input(N,A);
printf("/n");
printf("please input B:");
printf("/n");
input(N,B);
STRASSEN(N,A,B,C);
output(N,C);
getch();
}
- strassen in c language.
- interview in C language
- setjmp & longjmp in C language
- typedef feature in c Language
- Object oriented in c language
- signed&&unsigned in the c language
- about the character string in C language
- Linux MD5 programming in C Language
- Linux MD5 programming in C Language
- Key word:const in C language
- Const and volatile in C language
- Macro expand in C programming language
- switch case without break in C language
- The amazing efficiency of pointer in C Programming Language
- about the escaper character in C programming language
- C language——read ip address in linux
- Code in C Language for SOJ 1001. Alphacode
- C language
- 关于GC垃圾收集器的一个C#例子
- 正确及时关闭数据库连接
- 对网站部分url进行了优化
- 让Flash乖乖躲到Div浮动层下去
- [翻译]High Performance JavaScript(023)
- strassen in c language.
- Qt信号槽机制的简单例子
- 博文视点大讲堂第30期——职场新人胜出的关键点
- 关于超文本的样式
- [翻译]High Performance JavaScript(024)
- Visio虚线框复制到Word中变实线框解决方案
- directX
- 初始化加载SWF中定义的类
- [翻译]High Performance JavaScript(025)