Solve Determinant of N x N Matrix in Java

By Sidharth Patnaik -
This is a Java program which can be used to find the Determinant of any Matrix. This program involves transforming the given N x N matrix to a Upper Triangle form.

 Screenshot[Demo]


The Code
package dProBuk;

import java.util.Scanner;

public class Det {

 public static void main(String[] args) {
  // TODO Auto-generated method stub
  Scanner s= new Scanner(System.in);
  int n;
  System.out.println("Give the value of N for [N x N]: ");
  n=s.nextInt();
  double a[][]=new double [n][n];
  //Storing Values in the Array !
  for (int i=0;i<n;i++)
   for (int j=0;j<n;j++)
    a[i][j]=s.nextInt();
  // Conversion of matrix to upper triangular 
     for(int i = 0; i < n; i++)
     {
         for(int j = 0; j < n; j++)
             if(j>i)
             {
                 double ratio = a[j][i]/a[i][i];
                 for(int k = 0; k < n; k++)
                     a[j][k] -= ratio * a[i][k];                      
             }
     }
     double det = 1.0; //storage for determinant
     for(int i = 0; i < n; i++)
         det *= a[i][i];
     System.out.println("The Det is : "+det);
     s.close();
 }
}

Found Bugs, or wanna Give Hugs, Share it.. and comment them ! :D

Comments

  1. Ashu Only1 February 2020 at 13:55

    Can u please let me know
    for(int j = 0; j < n; j++)
    if(j>i)
    {
    double ratio = a[j][i]/a[i][i];
    for(int k = 0; k < n; k++)
    a[j][k] -= ratio * a[i][k];
    }

    How it is working.
    In detail.

    I am not able to understand, how ratio working here.

    ReplyDelete

Post a Comment

Popular posts from this blog

Non Restoring Division Algorithm Implementation in C

By Sidharth Patnaik -
Image
This  is a Dynamic program for the implementation of the NON RESTORING Division Algorithm in C Language. Non Restoring Division uses Left Shift Operations, Twos' Compliment and Binary Addition. Screenshots[Demo] The Code #include<stdio.h> #include<malloc.h> int *a,*q,*m,*mc,*c,n,d; int powr(int x,int y) { int s=1,i; for(i=0;i<y;i++) s=s*x; return s; } void print(int arr[],int n) { int i; for(i=0;i<n;i++) printf("%d ",arr[i]); } void bin(int n, int arr[]){ int r, i = 0; do{ r = n % 2; n /= 2; arr[i] = r; i++; }while(n > 0); } void set(int array[], int x){ int i,tmp[20]={0}; for(i = x -1; i >=0; i--) tmp[x-1-i]=array[i]; for(i=0;i<x;i++) array[i]=tmp[i]; } int len(int x) { int i=0; while(powr(2,i)<=x) i++; return ++i; } void addBinary(int a1[], int a2[]) { int bi[2]={0},ca[20]={0}; int t=len(n),tmp=0; int *su=(int*)malloc(sizeof(int)*len(n)); while(t...
Read more

Hackerrank String Reduction Solution

By Sidharth Patnaik -
Image
This is the solution to the program, solved in python. The Question can be found in the Algorithm domain of Hackerrank. Problem Statement: Given a string consisting of letters, a, b and c, we can perform the following operation: Take any two adjacent distinct characters and replace them with the third character. For example, if 'a' and 'c' are adjacent, they can replaced by 'b'. Find the smallest string which we can obtain by applying this operation repeatedly? Screenshots[Demo] The Code: def cnt(x): m={} m['a']=0;m['b']=0;m['c']=0 for c in x: if c not in m: m[c]=1 else: m[c]+=1 return m def red(x): xm=cnt(x) print x,xm if((xm['a']==0 and xm['b']==0 ) or (xm['a']==0 and xm['c']==0 ) or (xm['b']==0 and xm['c']==0)): return len(x); if((xm['a']%2==0 and xm['b']%2==0 and xm['c']%2==0) or (...
Read more

Hackerrank Modified Kaprekar Numbers Solution

By Sidharth Patnaik -
Image
This is the solution to the Modified Kaprekar Numbers found in the implementation section of the algorithm domain in Hackerrank. A modified Kaprekar number is a positive whole number n with d digits, such that when we split its square into two pieces - a right hand piece r with d digits and a left hand piece l that contains the remaining d or d−1 digits, the sum of the pieces is equal to the original number (i.e. l + r = n) . Screenshot The Code def sendKap(x,s): y=x*x y=str(y) s1=y[:len(y)/2:] s2=y[len(y)/2::] s3=int(s1)+int(s2) if(s3==x): s.append(str(x)) st=input() en=input() s=[] for i in range(st,en+1): if(i>9): sendKap(i,s) elif(i==1): s.append(str(i)) elif(i==9): s.append(str(i)) if(len(s)==0): print 'INVALID RANGE' else: print ' '.join(s) Got any problems feel free to comment them here !
Read more