3If you compare the speed of our fib function to the library function, our version is still slower. This is because
the library fibonacci uses a “powering algorithm” with a computing time proportional to 
to compute
fibonacci(n).
3If you compare the speed of our fib function to the library function, our version is still slower. This is because
the library fibonacci uses a “powering algorithm” with a computing time proportional to to compute
fibonacci(n).