一同学在学习线性代数时突发奇想,想写一个程序可以计算行列式的值,没写出来,所以叫我去给他查看错误,我想倒不如自己写一个,于是就写了出来,如下:
#include<iostream>
#include<math.h>
using namespace std;
int** pArray(int**array, int m);
int** inputArray(int **array, int m);
double calMatrix(int** temp, int m);
int main()
{ //二维数组
int **temp = NULL;
int **array = NULL;
int m;
printf("please input the matrix order:\n");//输入矩阵阶数
cin >> m;
//申请空间
array = (int**)malloc(sizeof(int*)*m);
int i;
for (i = 0; i < m; i++) {
array[i] = (int*)malloc(sizeof(int)*m);
}
printf("input the array:\n");
inputArray(array, m);
printf("the array you input:\n");
pArray(array, m);
cout<<calMatrix(array, m);
system("pause");
return 0;
}
int** pArray(int **array, int m) {
//m*m阶矩阵
//输出矩阵
int i = 0;
int j = 0;
for (i = 0; i < m; i++) {
printf("||");//矩阵中括号
for (j = 0; j < m; j++) {
printf("%d\t", array[i][j]);
}
printf("||");
printf("\n");
}
return array;
}
int** inputArray(int** array, int m) {
int i = 0; int j = 0;
for (i = 0; i < m; i++) {
printf("||");
for (j = 0; j < m; j++) {
cin >> array[i][j];
}
printf("||");
printf("\n");
}
return array;
}
double calMatrix(int ** temp, int m)
{
int **Matrix = NULL,i;
double result=0;
if (m == 1) {
return temp[0][0];
}else if (m == 2) {
return temp[0][0] * temp[1][1] - temp[0][1] * temp[1][0];
}else{
for (i = 0; i < m; i++) {
Matrix = (int**)malloc(sizeof(int *)*(m-1));
for (int k = 0; k < m - 1; k++) {
Matrix[k] = (int *)malloc(sizeof(int)*(m - 1));
}
for (int k = 1,a=0; k < m&&a<m-1; k++,a++) {
for (int j = 0,b=0; j < m&&b<m-1; j++) {
if (j == i)
continue;
else
Matrix[a][b++] = temp[k][j];
}
}
/*cout << "i=" << i << endl;
pArray(Matrix, m - 1);
cout << endl;*/
result+=temp[0][i]*pow(-1,i)*calMatrix(Matrix,m-1);
}
}
return result;
}