function f = fiboRec(n)
    % Recursive implementation of the fibonacci numbers
    % short, but VERY inefficient because it wastes
    % a lot of time redoing the same computations over and over. 

    if n <= 1 %seeding the base cases n=0, n=1. 
        f = n;
    else
        f = fiboRe(n-1) + fiboRec(n-2); 
    end

end