write a c++ program to solve a n ordered determinant?

Question

do give simple logic

Answer 1

First, read about determinants here: http://en.wikipedia.org/wiki/Determinant
Notice how the determinant of the 3x3 matrix may be written in terms of the determinants of the 2x2 matrices (in the second and third rows). The 4x4 determinant may be written in terms of the determinants of the 3x3 matrices it contains (below the top row). This is true in general, so you should develop a recursive algorithm to find the determinant of the nxn matrix.
OK, I know you're still confused. This page has an actual algorithm (but not in C++) for the process:
http://mcraefamily.com/MathHelp/MatrixDeterminant.htm
That's as far as I'm taking it. Good luck!

Oh, wait! There's a typo on the last page I linked. The algorithm says "matrix B = matrix A with row i and column 1 deleted" but it should say "matrix B = matrix A with row 1 and column i deleted". I'm pretty sure that's how it goes. Here's another reference, just in case you're still confused: http://mathworld.wolfram.com/DeterminantExpansionbyMinors.html
Maybe the author of that page was just got his rows and columns mixed up, but this should clear it all up. Good luck!

Answer 2

I trhink you will find example code in the article.

Dr Dobb's
Typelists & C++ Polynomial Meta-Arithmetic
http://www.ddj.com/dept/cpp/184401834

Hope this helps.

Answer 3

cout<<"Please give clearer explanation.";
cout<<"Thank You";