Рекурсивная функция

using namespace std;
void rekursija(long long factorials[], int ArSize);
int main()
{
    cout << "Pls enter the number: " << endl;
    int ArSize;
    cin >> ArSize;
    long long * factorials = new long long[ArSize];
    
    rekursija(factorials, ArSize);
 
    system ("pause");
    return 0; 
}
 
void rekursija(long long factorials[], int ArSize)
    {
    factorials[1] = factorials[0] = 1;
    for (int i = 2; i < ArSize; i++)
    {
        factorials[i] = i * factorials[i-1];
    };
    for (int i = 0; i < ArSize; i++)
        std::cout << i << "! = " << factorials[i] << std::endl;
 
    cin >> ArSize;
    delete []factorials;
        if(ArSize != 0)
        {
        rekursija(factorials, ArSize);
        };
 
};

#include <iostream>
 
using namespace std;
 
void rekursija(unsigned long long factorials[], int ArSize);
 
int main()
{
    cout << "Pls enter the number: " << endl;
    int ArSize;
    cin >> ArSize;
    unsigned long long * factorials = new unsigned long long[ArSize];
    
    rekursija(factorials, ArSize);
 
    delete []factorials;
 
    system ("pause");
    return 0; 
}
 
void rekursija(unsigned long long factorials[], int ArSize)
    {
    factorials[1] = factorials[0] = 1;
    for (int i = 2; i < ArSize; i++)
    {
        factorials[i] = i * factorials[i-1];
    };
    for (int i = 0; i < ArSize; i++)
        std::cout << i << "! = " << factorials[i] << std::endl;
}

unsigned long long factorial( unsigned long long i ) {
    if ( i <= 1 ) return 1;
    return i * factorial( i - 1 );
}