Eg Question no 16:

In the recursive equation, v is into consideration, so time complexity will be O(n*v) but through this how will we be able to achieve maximum value?

For eg. what if we are able to select all the toys, in that case maximum value will be summation of all the value, but according to recursive equation v is up to 100 only.

So, my question is we do not before hand maximum v can be achieved then how can we make recursive equation on the basis of v?