The problem with this brute-force approach to the prefix sum problem is that it is highly inefficient. Discrete logic must be performed on every element of the array. As arrays become larger, the ...