Your array based solution is limiting in that you have set the array size to the number of values to display.
What about a purely iterative solution, that does not need the excess memory, and is not logically limited in the number of values to display?
#include <iostream>
using namespace std ;
int main ( )
{
unsigned int fib ; //current fibonnaci value
unsigned int n1 = 1 ;
unsigned int n2 = 1 ;
int max_fib;
cout << "Enter number of term for Fibonacci series: " ;
cin >> max_fib;
cout << n1 << '\t' << n2 << '\t';
for ( int i = 2 ; i < max_fib; i ++ )
{
fib = n1 + n2;
n1 = n2;
n2 = fib;
cout << fib << "\t" ;
if( i % 5 == 0 ) //five numbers per line
cout << endl;
}
return 0 ;
}