I have a problem where solving the k'th index subproblem depends on both the right and left portions :

T(0:k)=T(0:k-1)+T(k+1:n)

where 'n' is the size of the problem, recursion leads to infinite cycle

could someone help with this

Thanks