For this you will write a Gaussian Elimination routine (with or without pivoting - for most of you, I highly suggest without) that solves the equation A x = b where A is a square matrix (num by num), and x and b are vectors. A and b are known, you are solving for x. It will return ierr, where ierr will be a non zero value if there is a problem. You may determine what non zero number to return for what problems. Your prototypes follow:

C++:

void ge(double **A,double b[],long int num,double x[],long int ierr)