A puzzle involving dynamic programming, or maybe it doesn't

Raymond ChenMarch 31, 2014Mar 31, 201403/31/14

Here's a programming challenge: Evaluate the following recurrence relation efficiently for a given array [x0, …, xn−1] and integer k. Hint: Use dynamic programming. In words: If the array has only two elements, then the result is the average of the two elements. If the array has more than two elements, then ...