Bottom up approach vs recursion

What is the difference between bottom up approach and recursion in the case of fibonacci example?