learn dynamic programming
Why Data Scientists Should Learn Dynamic Programming
DP is a type of algorithm that breaks down problems into sub-problems and stores and reuses the results from the previous calculations. We shall introduce what a recursion is before DP. A recursive function is a function defined in relation to itself, which means the function will continue to call itself until some condition is met. A recursion contains two parts: a base case and a recursive case. The function will keep iterating the recursive case and calculate the results to sub-problems until the base case is met.