Sarrus |A|, Minors Parser for matrix with n>5

All replies

• 

  

  0

  Sign in to vote

  How to export temp[][] as array from function as private variable without class? Hows to create multiple copy of subroutine with independent private variables (new subroutine name) with reference on  insuroutine new copy of subroutine without error ?

  Tuesday, February 17, 2015 1:02 AM
• 

  

  0

  Sign in to vote

  How to use  "new", "malloc", private: factorization, Gauss method using only

  "multiruned" subhierarhical decomposition by line(column) and Sarrus's rule ?

  Tuesday, February 17, 2015 1:11 AM
• 

  

  0

  Sign in to vote

   http://www.linuxquestions.org/questions/programming-9/matrix-determinant-program-in-c-and-c-executable-25-times-larger-than-the-other-649405/

  examples

  Tuesday, February 17, 2015 1:49 PM
• 

  

  0

  Sign in to vote

  //#include <iostream>
  #include <stdio.h>
  #include <stdlib.h>
  #include <conio.h>
  #include <math.h>
  // #include <cmath>
  //using namespace std;

   //double ** submatrix( double **matrix, int order, int i, int j);
   //double determinant( double **matrix, int order);

   

  
   double** submatrix( double **matrix, int order, int i, int j)
  {

    double **subm;
   int p, q;    // Indexes for matrix
   int a = 0, b;  // Indexes for subm
   //subm = new  double* [order - 1];

           subm = (double **) malloc((order-1)*sizeof(double *));

   for(p = 0; p < order; p++) {
    if(p==i) continue;    //Skip ith row
     
                      //subm[a] = new  double[order - 1];
                        subm[a]=(double *) malloc((order-1)*sizeof(double));
     b = 0;

    for(q = 0; q< order; q++) {
      if(q==j) continue;  //Skip jth column
     subm[a][b++] = matrix[p][q];
    }
    a++; //Increment row index
   }
   return subm;
  }

   double determinant( double **matrix, int order)
  {      
           double determ = 0;
   if(order == 1)
    return **matrix; //Return the element if the matrix is of order one

  
          if(order == 2){
                    determ=(matrix[0][0]*matrix[1][1]-matrix[0][1]*matrix[1][0]);
                    return determ;
                        }
   int i;

   
   for(i = 0; i < order; i++)
    determ +=  (pow(-1.0,i)) * matrix[i][0] * determinant(submatrix(matrix,order, i, 0), order - 1);
  // delete  matrix;
   return determ;
  }

  double algdop(double **matrix, int order, int i,int j)
  {
  return (pow(-1,i+j))*matrix[i][0] * determinant(submatrix(matrix,order, i, j), order - 1);
  }

  
  int main()
  {
   int i, j, order;

    printf("Enter the order of the matrix: ");
    scanf("%d",&order);
          //Allocate memory for pointers (each pointer represents a row)
          //matrix= new  double* [order];

   double **matrix =(double **) malloc(order*sizeof(double *)); 
   
            
          printf("Enter the elements of the matrix: \n");
   
   
   for(i = 0; i < order; i++) {

     //matrix[i] = new  double[order];
                          //Each row contains 'order' number of elements

                          matrix[i]=(double *) malloc(order * sizeof(double ));

    for(j = 0; j< order; j++){
   
      scanf("%le",&matrix[i][j]);
     
   }

     
     
     
     
     
     
     
   }
      printf("\nOk  " );
   
          double result=determinant(matrix, order);

       printf("\nParsing determinant Ok  " );
   printf("\nDeterminant: %le  ", result);
   
   return 0;
  }

  
  

  • Edited by USERPC01 Tuesday, February 17, 2015 4:28 PM

  Tuesday, February 17, 2015 4:26 PM