Course-of-values recursion

Course-of-values recursion is a concept in computer science and programming languages, particularly in relation to the design of recursive functions. It refers to a specific style of recursion where the function computes values of subproblems first and stores them in some form of intermediate structure (such as a list or an array) before making use of these computed values to produce the final result. In traditional recursion, a function may call itself multiple times for subproblems, recalculating values each time the subproblem appears.