Gauss Elimination. The accuracy of the Gauss elimination technique can be improved using a...

Gauss Elimination. The accuracy of the Gauss elimination technique can be improved using a process called pivoting. To perform row pivoting, we first reorder the equations so that the equation with the largest absolute value for the first coefficient is the first equation. We then eliminate the first object from the equations that follow the first equation. Then, starting with the second equation, we reorder the equations such that the second equation has the largest coefficient (in absolute value) for the second object. We then eliminate the second object from all equations after the second equation. The process continues similarly for the rest of the objects. Assume that a symbolic constant N contains the number of equations.

Column pivoting is performed in a similar fashion to row pivoting by exchanging columns such that the largest coefficient (in absolute value) will be in the position of interest. When columns are exchanged, it is important to keep track of the changes in the order of the objects. Write a function to perform column pivoting. Include parameters to specify changes in the order of the objects. Assume that the corresponding function prototype is

void pivot_c(double a[][N+1], int j, int reorder k[N]);