WEEK #5

We started learning about the closed-form of recursive functions. This seems like a very useful tool (and probably is) since it transforms a quite tedious type of function into a more familiar and simpler one. This process will come in handy when testing recursive functions or needing a less memory-intensive function that will achieve the same or at least a very similar result. For example, in order to find a specific Fibonacci number, one had to find all the previous Fibonacci numbers in order to come up with the original number that was needed or one could have used a computer program which would do the same process a little faster. With a closed-form of the Fibonacci function, to find a specific number in the sequence, one just has to plug-in and do a couple simple mathematical operations.