这里给出采用递归方式计算一个n阶的行列式的方法,行列式的值存入vector< vector<double> >
类型的二维容器中,这里设定按第一行依次展开计算第一行每个元素的代数余子式。
/****************************** Module Header ******************************\
Module Name: TestEverything.cpp
Project: Code Practice
Copyright The essence of knowledge is sharing!
Written by: NobodyZhou
Date: July 19, 2015
This source is a method to caculate det(A) by recursion. This algorithm to be achieved in C++.
\***************************************************************************/
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
using namespace