Recursive method for Fibonacci sequence C + +

//the recursive method is implemented as follows:#include"stdafx.h"#include<iostream>using namespacestd;voidFintnum) {    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<<"The output Fibonacci sequence is as follows:"<<Endl;  for(i =0; i < num; i++) {cout<< P[i] <<"   "; }}intMain () {intnum; cout<<"Please enter the number of Fibonacci sequence elements you want to display:"; CIN>>num;    F (num);    GetChar (); return 0;}

These are the homework that the lab teacher called us to write.

Recursive method for Fibonacci sequence C + +