The inner loop of the cubic maximum subsequence sum algorithm performsN(N+1)(N+2)/6
Chapter 2, Problem 2.34(choose chapter or problem)
The inner loop of the cubic maximum subsequence sum algorithm performsN(N+1)(N+2)/6 iterations of the innermost code. The quadratic version performsN(N + 1)/2 iterations. The linear version performs N iterations. What pattern isevident? Can you give a combinatoric explanation of this phenomenon?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer