We are working to restore the Unionpedia app on the Google Play Store
OutgoingIncoming
🌟We've simplified our design for better navigation!
Instagram Facebook X LinkedIn
Your own Unionpedia with your logo and domain, from 9.99 USD/month
Create my Unionpedia

Maximum segment sum problem

Index Maximum segment sum problem

No description. [1]

Table of Contents

  1. 1 relation: Maximum subarray problem.

Maximum subarray problem

In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A of numbers.

See Maximum segment sum problem and Maximum subarray problem

References

[1] https://en.wikipedia.org/wiki/Maximum_segment_sum_problem