’ Z„DET M;N;J
[1]   …3×¼2<N„1†½M
[2]   …0,Z„(×/ 1 1 ³M)-×/ 1 1 ³²M
[3]   J„1+Z„0
[4]   Z„Z+M[1;J]×(¯1*J+1)×DET M[1‡¼N;(J¬¼N)/¼N]
[5]   …4×¼N‰J„J+1
[6]   © Recursively compute the determinant of a matrix from
[7]   © John Clark's CS270 course at Orange Coast College, CA
    ’
    
    
    ’ D„det m;b;lp;iv;i;c;swap
[1]
[2]   © Evaluate determinant <D> of <m> by reduction to triangular form.
[3]   © Each loop sets next diagonal element to one.
[4]   ©
[5]   © David Edwards <david@btdt.org> Mon Feb 12 22:22:14 EST 2001
[6]   b„m=D„0
[7]   …(1¹(^/b),^šb)½0
[8]
[9]   c„i„†iv„¼†½m
[10]  lp„((¯1+½iv)½LP),DONE
[11]
[12]  LP:
[13]    iv„1‡iv
[14]    …(m[i;i]¬0)½OK
[15]      …(0=swap„†(m[iv;i]¬0)/iv)½DONE
[16]      ©'swap: ',•swap
[17]      m[swap,i;]„m[i,swap;]
[18]      c„-c
[19]    OK:
[20]    c„c×m[i;i]
[21]    m[i;]„m[i;]÷m[i;i]
[22]    m[iv;]„m[iv;]-m[iv;i]°.×m[i;]
[23]    ©mª''                         © Uncomment this line to see each step
[24]    …lp[i„i+1]
[25]  DONE:
[26]  D„c×m[i;i]
    ’