實現簡單遞歸c++實現

代碼一
#include <iostream>
using namespace std;

void diGui();
//實現一個簡單的遞歸 
int main()
{
    diGui();
    return 0;
}
void diGui()
{
    static int i = 10;
    if(i == 1)
    {
        cout << "i: " << i << " 時遞歸結束\n";
    }
    else
    {
        cout << "i: " << i << endl;
        i--;
        diGui();
    }
}
代碼二

#include <iostream>
using namespace std;

int diGui(int temp);
//實現一個簡單的遞歸 
int main()
{
    int i = 5;
    int value = diGui(i);
    cout << "value: " << value << endl;
    return 0;
}
//求階乘 采用遞歸求解 
int diGui(int temp)
{
    if(temp == 1 || temp == 0)
    {
        return 1;
    }
    else
    {
        return temp * diGui(temp-1);
    }
}