c++实现矩阵类矩阵行列式，伴随矩阵，逆矩阵

//Matrix ver1.0
//只支持矩阵内部（方阵）的运算
#include<iostream>
#include<math.h>
using namespace std;
class matrix
{
    double**num;
    int **e;//单位矩阵
    int r;
    int c;
    unsigned int *array;//为全排序原矩阵列标提供初始顺序模板
    unsigned int*arr;//为全排序伴随矩阵列标提供初始顺序模板
    int**b;//存放原矩阵列标
    int j;//计数变量，原矩阵的全排列
    int po;//计数变量，伴随矩阵的全排列

    double **comp;//伴随矩阵
    double**s;//存放每一个num的余子式
    int**sb;//存放每一个余子式的列标

public:
    double caculate();
    matrix(int n, int m);//nrow
    void setmat();
    bool checkcomp() { if (po)return true; return false; }
    void showm();
    void showinver(double k);
    void swap(unsigned int* array, int i, int j);
    void FullArray(int n, int index);
    int func(int n) { if (n == 0)return 1; else return n*func(n - 1); }
    int ni(int a[], int n);
    void sets(int a, int b);
    double cacu(int a, int b);
    void setcomp();
    void showcomp();
    void fullArray(int n, int index = 0);
    void shows();
    void showsb();

};
void matrix::shows()//r
{
    for (int i = 0; i < r - 1; i++)
    {
        for (int j = 0; j < c - 1; j++)
            cout << s[i][j] << " ";
        cout << endl;
    }
}
void matrix::showcomp()
{
    for (int i = 0; i < r; i++)
    {
        for (int j = 0; j < c; j++)
            cout << comp[i][j] << " ";
        cout << endl;
    }
}
void matrix::setcomp()
{
    for (int i = 0; i < r; i++)
        for (int j = 0; j < c; j++)
            comp[i][j] = pow(-1, j + i)*cacu(i, j);

}
double matrix::cacu(int a, int b)//计算每一位的代数余子式
{
    sets(a, b);
    double sum = 0;
    double *p = new double[c - 1];
    for (int i = 0; i < func(c - 1); i++)
    {
        p[i] = 1;
        for (int j = 0; j < c - 1; j++)
            p[i] *= s[j][sb[i][j]];
        p[i] = p[i] * pow(-1, ni(sb[i], c - 1));
        sum += p[i];
    }
    return sum;
}
void  matrix::sets(int a, int b)//把(a,b)的余子式存入**s
{
    int t = 0;
    int *cun = new int[(c - 1)*(r - 1)];
    for (int i = 0; i < r; i++)
        for (int j = 0; j < c; j++)
        {
            if (i != a&&j != b)
            {
                cun[t] = num[i][j];
                t++;
            }
        }
    for (int i = 0; i < r - 1; i++)
        for (int j = 0; j < c - 1; j++)
            s[i][j] = cun[i*(r - 1) + j];
}
void  matrix::showm()//r
{
    for (int i = 0; i < r; i++)
    {
        for (int j = 0; j < c; j++)
            cout << num[i][j] << " ";
        cout << endl;
    }
}
int matrix::ni(int a[], int n)//逆序数
{
    int s = 0;
    for (int j = n - 1; j >= 0; j--)
        for (int i = 0; i < j; i++)
        {
            if (a[j] < a[i])
                s++;
        }
    return s;
}
void matrix::swap(unsigned int*array, int i, int j)//r
{
    int t = array[i];
    array[i] = array[j];
    array[j] = t;
}
void  matrix::showsb()
{
    for (int i = 0; i < func(r - 1); i++)
    {
        for (int j = 0; j < c - 1; j++)
            cout << sb[i][j];
        cout << endl;
    }
}
void  matrix::fullArray(int n, int index)//对于伴随矩阵全排列
{
    if (index >= n)
    {
        for (int i = 0; i <n; ++i)
        {
            sb[po][i] = arr[i];
        }
        po++;
        //return;
    }

    for (int i = index; i < n; ++i)
    {
        swap(arr, index, i);
        fullArray(n, index + 1);
        swap(arr, index, i);
    }
}
void  matrix::FullArray(int n, int index)//r
{
    if (index >= n)
    {
        for (int i = 0; i <n; ++i)
        {
            b[j][i] = array[i];//把全排列存入b[][]中
        }
        j++;
    }

    for (int i = index; i < n; ++i)
    {
        swap(array, index, i);
        FullArray(n, index + 1);
        swap(array, index, i);
    }
}

void matrix::showinver(double k)
{
    for (int i = 0; i < r; i++)
    {
        for (int j = 0; j < c; j++)
            cout << comp[i][j] / k << " ";
        cout << endl;
    }
}
matrix::matrix(int n, int m) :r(n), c(m)//r
{
    j = 0;
    array = new unsigned int[c];
    for (int i = 0; i < c; i++)
        array[i] = i;
    arr = new unsigned int[c - 1];
    for (int i = 0; i < c - 1; i++)
        arr[i] = i;
    num = new double*[n];
    b = new int*[func(c)];
    for (int i = 0; i < r; i++)
        num[i] = new double[c];
    for (int i = 0; i < func(c); i++)
        b[i] = new int[c];
    e = 0;

    sb = 0;
    s = 0;
    po = 0;
    if (r == c)
    {
        sb = new int*[func(c - 1)];
        for (int i = 0; i < func(c - 1); i++)
            sb[i] = new int[c - 1];
        s = new double*[r - 1];
        for (int i = 0; i < r; i++)
            s[i] = new double[c - 1];
        comp = new double*[r];

        for (int i = 0; i < r; i++)
            comp[i] = new double[c];


        e = new int*[r];
        for (int i = 0; i < r; i++)
            e[i] = new int[c];
        for (int i = 0; i < r; i++)
            for (int j = 0; j < c; j++)
            {
                if (i == j)
                    e[i][j] = 1;
                else
                    e[i][j] = 0;
            }
    }
}
void matrix::setmat()
{
    cout << "请按行输入你的矩阵：" << endl;
    for (int i = 0; i < r; i++)
        for (int j = 0; j < c; j++)
            cin >> num[i][j];
    //num[i][j] = i*r + j;
}
double matrix::caculate()//计算原矩阵行列式
{
    FullArray(c, 0);
    double sum = 0;
    double *p = new double[c];
    for (int i = 0; i < func(r); i++)
    {
        p[i] = 1;
        for (int j = 0; j < c; j++)
            p[i] *= num[j][b[i][j]];
        p[i] = p[i] * pow(-1, ni(b[i], c));
        sum += p[i];
    }
    return sum;
}
void main()
{
    int C, R;
    int choice = 100;
    matrix *p = 0;
    double k;//储存行列式的值
    while (choice)
    {
        cout << "1:创建一个矩阵对象
2:输出矩阵行列式的值
3：输出伴随矩阵
4：输出逆矩阵
5:结束" << endl;
        cout << "请输入你的选择" << endl;
        cin >> choice;
        switch (choice)
        {
        case 1:
            cout << "请输入矩阵的行与列：" << endl;
            cin >> C >> R;
            p = new matrix(C, R);
            p->setmat();
            break;
        case 2:
            if (C == R)
            {
                k = p->caculate();
                cout << "矩阵行列式的值：" << k << endl;
            }
            else
                cout << "非方阵，无法计算" << endl;
            break;
        case 3:
            if (C == R)
            {
                p->fullArray(C - 1, 0);//先给下标全排序好，存入相应数组
                p->setcomp();
                p->showcomp();
            }
            else
                cout << "非方阵，无法计算" << endl;
            break;
        case 4:
            if (C == R)
                    if (p->checkcomp())
                        p->showinver(k);
                    else
                        cout << "请先计算伴随矩阵。" << endl;
            else
                cout << "非方阵，无法计算" << endl;
            break;
        case 5:
            choice = 0;
            break;
        }
    }
}

=====================6.18update&BUG已改===========================