线性代数·矩阵的加法减法乘法运算简单实现

#include <stdio.h>
#include <stdlib.h>
typedef int Array_Size;

typedef struct matrix{
	Array_Size ** array;
	int line;
	int cow;
}Matrix;

void Addition(Matrix &A,Matrix &B);//加法运算 A+B=C 
void Subtraction(Matrix &A,Matrix &B);//减法运算 A-B=C 
void Multiplication(Matrix &A,Matrix &B);//乘法运算 A*B=C 
void PrintSolution(Matrix &A,Matrix &B,Matrix &C,char op);//输出运算结果 
void MatrixInit(Matrix &A,Matrix &B);//矩阵数据初始化 
void PrintArray(Matrix &T);//打印一个矩阵信息 
void DestroyArray(Matrix &T);//销毁一个矩阵 

void Addition(Matrix &A,Matrix &B)
{
	int i,j;
	Matrix C;
	
	if(A.line != B.line || A.cow != B.cow){
		printf("Can't Match!\n");
		return;
	}
	
	C.line = A.line;
	C.cow = A.cow;
	C.array = (Array_Size **)malloc(C.line * sizeof(Array_Size *));
	for(i=0;i<C.line;i++)
		C.array[i] = (Array_Size *)malloc(C.line * sizeof(Array_Size));
	for(i