This repository is a solution to an assignment given in an introductory course on numerical linear algebra. The problem is to write a loop-less implementation of determinant expansion. An example program is provided as a benchmark. In the end we are asked to write a script which compares the given function, our implementation and MATLAB's built-n' determinant function's runtime for random matrices of certain sizes.
The resulting graph shows a clear performance gap which grows larger as the matrix increases in size. However this is hard to verify as this method of computing the determinant is O(n!) and thus it is impractical to test these functions for larger matrices.