Problem 3.2.6. See handout. As per the problem, write a program to compute the determinant of a matrix. ( If you refer to a Linear Algebra text, you may find the minors are called co-factors.) It should read a matrix, print it out, compute and print the determinant. Your program should be able to evaluate multiple matrices on a single execution. For class purposes your program should handle matrices upto and including those of order 6. In a real application the sizes could, of course, be much larger. Use of recursion is okay but not mandatory. Use some form of linked list structure to store the matrix. You may use double, single, circular or multilinked lists with or without headers. Please give this careful consideration. In justifying your choice of data structures please consider real world constaints. Justify your choice of recursion or iteration. Be sure to compare your results to what you observed in Lab 2. As a minimum use the following 8 matrices to test your program. Use the same required input and the same input format as Lab 2.
In previous lab 2, I completed a program for Array impeletion matrix(please see attachments). The need for this question is to modify my existing lab 2 code to use some form of linked list structure to store the matrix. And using the matrix to compute and print the determinants. You may use double, single, circular or multilinked lists with or without headers. Also, please provide a brief summary of effientcy costs for linked list structure and array structure to store the matrix.
No related question exists