递归方法实现斐波那契数列C++

//递归方法实现，如下：
#include "stdafx.h"
#include <iostream>
using namespace std;
void F(int num)
{
    int *p = new int[num],i;
    p[0] = 0;
    p[1] = 1;
    for (i = 2; i < num; i++)
    {
        p[i] = p[i - 1] + p[i - 2];
    }
    cout << endl;
    cout << "输出斐波那契数列如下：" << endl;
    for (i = 0; i < num; i++)
    {
        cout << p[i] << "   ";
    }
}
int main()
{
    int num;
    cout << "请输入你要显示的斐波那契数列元素的个数：";
    cin >> num;
    F(num);
    getchar();
    return 0;
}