At class, when we present a dynammic programming solution - we only show the recursive formula/algorithm when required to present an dynammic programming algorithm to solve a problem.
I accept this because it is pretty obvious that every recursion algorithm we describe can be easily converted to an iterative algorithm which cache previous results in some sort (Dictionary, Matrix, Array and etc.)
My question is - Can we also just present a recursive algorithm/formula in HW and say we implement it in dynammic programming without describing the exact iterative algorithm and how we cache previous results? Or is it mandatory?
Meaning - Can we just describe the recursive algorithm and state that we cache previous results?
Thanks in advance.