Dynamic programming- fiboncci numbers bottom-up approach

#include <iostream>
using namespace std;
//Nth fibonacci number using bottom-up approach
int fib[100];
int fibo(int n)
{
      if (n==0 )
         return 0;
      if(n==1)
         return 1;
      fib[0]=0;
      fib[1]=1;
      for(int i=2;i<=n;i++)
           fib[i]=fib[i-1]+fib[i-2];
      return fib[n];
}
int main()
{
      int n=5;
      cout<<fibo(5)<<endl;
 
}