算法导论矩阵乘法(简单分治)

最新推荐文章于 2023-02-19 19:36:04 发布

niewei1986

最新推荐文章于 2023-02-19 19:36:04 发布

阅读量1.2k

点赞数 1

分类专栏：算法导论

本文链接：https://blog.csdn.net/niewei1986/article/details/64919971

版权

算法导论专栏收录该内容

243 篇文章 9 订阅

订阅专栏

#include <stdio.h>
#define LEN 4

typedef struct
{
	int rowstart;
	int rowend;
	int colstart;
	int colend;
}Square;

int A[LEN][LEN]={{1,2,3,4},{3,4,5,6},{5,6,7,8},{7,8,9,10}};
int B[LEN][LEN]={{5,6,7,8},{7,8,9,10},{11,12,13,14},{15,16,17,18}};

void recurMult(int C[LEN][LEN],Square a,Square b)
{
	if(a.rowstart==a.rowend && a.colstart==a.colend &&
		b.rowstart==b.rowend && b.colstart==b.colend)
	{
		C[a.rowstart][b.colstart]+=A[a.rowstart][a.colstart]*B[b.rowstart][b.colstart];
		return;
	}

	Square a11={a.rowstart,(a.rowstart+a.rowend)/2,a.colstart,(a.colstart+a.colend)/2};
	Square a12={a.rowstart,(a.rowstart+a.rowend)/2,(a.colstart+a.colend)/2+1,a.colend};
	Square a21={(a.rowstart+a.rowend)/2+1,a.rowend,a.colstart,(a.colstart+a.colend)/2};
	Square a22={(a.rowstart+a.rowend)/2+1,a.rowend,(a.colstart+a.colend)/2+1,a.colend};
	Square b11={b.rowstart,(b.rowstart+b.rowend)/2,b.colstart,(b.colstart+b.colend)/2};
	Square b12={b.rowstart,(b.rowstart+b.rowend)/2,(b.colstart+b.colend)/2+1,b.colend};
	Square b21={(b.rowstart+b.rowend)/2+1,b.rowend,b.colstart,(b.colstart+b.colend)/2};
	Square b22={(b.rowstart+b.rowend)/2+1,b.rowend,(b.colstart+b.colend)/2+1,b.colend};

	recurMult(C,a11,b11);
	recurMult(C,a12,b21);
	recurMult(C,a11,b12);
	recurMult(C,a12,b22);
	recurMult(C,a21,b11);
	recurMult(C,a22,b21);
	recurMult(C,a21,b12);
	recurMult(C,a22,b22);
}

void print(int a[LEN][LEN])
{
	for(int i=0;i<LEN;i++)
	{
		for(int j=0;j<LEN;j++)
		{
			printf("%4d ",a[i][j]);
		}
		printf("\n");
	}
}

int main()
{
	int C[LEN][LEN]={0};
	Square a={0,LEN-1,0,LEN-1};
	Square b={0,LEN-1,0,LEN-1};
	recurMult(C,a,b);
	print(C);
	getchar();
}