c++---递归调试之递归过程打印

void printIncident(int ct) {
    for (int i = 0; i < ct; ++i) {
        cout << "       ";
    }
}
int total = 0;

int fbs(int n) {
    total++;
    if (n == 2) {
        printIncident(--total);
        cout << "n = " << n << endl;
        return 1;
    }
    if (n == 1) {
        printIncident(--total);
        cout << "n = " << n << endl;
        return 1;
    }
    int left = fbs(n - 1);
    int right = fbs(n - 2);
    printIncident(--total);
    cout << "n = " << n << endl;
    return left + right;
}


int main() {
    fbs(6);
}

void printIncident(int ct) {
    for (int i = 0; i < ct; ++i) {
        cout << "   ";
    }
}

int total = 0;

void permutation(vector<int> &data, int pos) {
    //total++;
    printIncident(total++);
    cout << "[";
    for (auto v : data) {
        cout << v << " ";
    }
    cout << "]\n";
    if (pos == (int) data.size()) {
        --total;
        cout << "                       {";
        for (auto v : data) {
            cout << v << " ";
        }
        cout << "}\n";
        return;
    }
    for (int i = pos; i < (int) data.size(); ++i) {
        swap(data[i], data[pos]);
        permutation(data, pos + 1);
        swap(data[i], data[pos]);
    }
    --total;
    //printIncident(--total);
}

int main() {
    vector<int> data = {1, 2, 3};
    permutation(data, 0);
}