/*here it uses a recursion function to find the determinant of the matrix It calculate determinant as per the definition of finding it */ /*Input order of matrix first, then each element row-wise Here input every element in seperate line (but order in first line) and total no of input should be square of the order otherwise it doesn't work -----------Try my other codes also ------------*/ #include #include using namespace std; double det = 0; double dat(int n, double mat[15][15]) { int c, subi, i, j, subj; double submat[15][15]; if (n == 2) { return( (mat[0][0] * mat[1][1]) - (mat[1][0] * mat[0][1])); } else { for(c = 0; c < n; c++) { subi = 0; for(i = 1; i < n; i++) { subj = 0; for(j = 0; j < n; j++) { if (j == c) { continue; } submat[subi][subj] = mat[i][j]; subj++; } subi++; } det = det + (pow(-1 ,c) * mat[0][c] * dat(n - 1 ,submat)); } } return det; } int main() { int n; cout<<"enter the order of matrix (Maximum-15) : " ; cin>>n; double mat[15][15]; int i, j; cout<<"\nEnter the elements of the matrix row-wise\n"<>mat[i][j]; } } cout<<"\n\t---------------------Given-Matrix-M is----------------------------\n\t\t\t"; for(i=0;i

Determinant of a (n*n)matrix Using recursion function.