def fib(n): if n==0: return 1 if n==1: return 1 return fib(n-1) + fib(n-2) RunTime =O(2^n). To improve this, one can use dynamic programming. We can use memoization. This involves using a list to reduce the number of function calls.