Is summing an array an example of dynamic programming?
When I am summing up an array of integers, I am basically reusing the the value I have obtained for subArray. Sum[i] = Sum[i - 1] + array[i]. Does this qualify to be overlapping subproblem property and hence an application of dynamic programming (though may be trivial)? 
Is summing an array an example of dynamic programming?
===

When I am summing up an array of integers, I am basically reusing the the value I have obtained for subArray. Sum[i] = Sum[i - 1] + array[i]. Does this qualify to be overlapping subproblem property and hence an application of dynamic programming (though may be trivial)? 