public static int ***Bath_Determinant(int[][] ***Bath_Matrix){ //method sig. takes a ***Bath_Matrix (two dimensional array), returns ***Bath_Determinant.

int sum=0;

int s;

if(***Bath_Matrix.length==1){ //bottom case of recursion. size 1 ***Bath_Matrix ***Bath_Determinant is itself.

return(***Bath_Matrix[0][0]);

}

for(int i=0;i<***Bath_Matrix.length;i++){ //finds ***Bath_Determinant using row-by-row expansion

int[][]smaller= new int[***Bath_Matrix.length-1][***Bath_Matrix.length-1]; //creates smaller ***Bath_Matrix- values not in same row, column

for(int a=1;a<***Bath_Matrix.length;a++){

for(int b=0;b<***Bath_Matrix.length;b++){

if(b<i){

smaller[a-1][b]=***Bath_Matrix[a][b];

}

else if(b>i){

smaller[a-1][b-1]=***Bath_Matrix[a][b];

}

}

}

if(i%2==0){ //sign changes based on i

s=1;

}

else{

s=-1;

}

sum+=s****Bath_Matrix[0][i]*(***Bath_Determinant(smaller)); recursive step: ***Bath_Determinant of larger determined by smaller.

}

return(sum); //returns ***Bath_Determinant value. once stack is finished, returns final ***Bath_Determinant.

}

.

> wrote this crap:

> >It still works quite well as a concept for such things as golf. (My

> >B.S. was in physics).

> Really? Can you calculate the determinate of a 7 by 7 matrix?

> This signature is now the ultimate

> power in the universe