Fibonacci (Dynamic && Recursion)

unsigned int dynamic_fibo(unsigned int n)
{
    unsigned int *arr = new unsigned int[n];
    arr[0] = 0;
    arr[1] = 1;
    arr[2] = 1;
    if(n<=2) return arr[n];
    for(unsigned int i = 3; i<=n; i++){
        arr[i] = arr[i-1]+arr[i-2];
    }
    return arr[n];
}

unsigned int fibo(unsigned int n)
{
    if(n==0) return 0;
    if(n==1||n==2) return 1;
    return fibo(n-1)+fibo(n-2);
}