Question: Name two methods to compute the determinant of an $n × n$ matrix. For each method, compute the complexity of the algorithm; i.e. count the expected number of multiplications to be performed in the algorithm. The result should be in terms of n.
The problem is that this is a linear algebra course, that's why i am inclined to believe that there will not be "big-oh" in the solution. So far I have tried to calculate for LU Decomposition yet, i couldn't figure it out.
Any help would be appreciated. Thanks in advance.