计算迭代矩阵

1. 帮同学写的计算迭代矩阵，随手记录一下

2. 代码

#include <iostream> 
#include <cmath>
#include <vector>
using namespace std;

const double MINUS=0.0005;
double initArray[3][3]={0.05,0.05,0.9,0.45,0.05,0.05,0.45,0.9,0.05};
struct Data{
	double a,b,c;
};
vector<Data> vData;

bool compare(Data first,Data second){
	if(abs(first.a-second.a)>MINUS)return false; 
	if(abs(first.b-second.b)>MINUS)return false; 
	if(abs(first.c-second.c)>MINUS)return false; 
	return true;
}

Data cal(double initArray[][3],Data ployed)
{
    Data data;
    data.a=initArray[0][0]*ployed.a+initArray[0][1]*ployed.b+initArray[0][2]*ployed.c;
    data.b=initArray[1][0]*ployed.a+initArray[1][1]*ployed.b+initArray[1][2]*ployed.c;
    data.c=initArray[2][0]*ployed.a+initArray[2][1]*ployed.b+initArray[2][2]*ployed.c;
    return data;
}

int main(){	
	Data first;
	first.a=1;
	first.b=1;
	first.c=1;
	Data second=first;
	vData.push_back(second); 
	do{
		first=second;
		second=cal(initArray,first);
		vData.push_back(second); 
	} while(!compare(first,second)); 
	cout<<second.a<<'\t'<<second.b<<'\t'<<second.c<<'\t'<<endl; 
	
	return 0;
}

3. 总结

    3.1 完全不需要自定义结构体，二维动态数组就好

    3.2 面向过程，没有面向对象