Definitions from Wikipedia (Maximum subarray problem)

▸ noun:  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[1...n] of numbers.


▸ Words similar to Maximum subarray problem
▸ Usage examples for Maximum subarray problem

▸ Idioms related to Maximum subarray problem
▸ Wikipedia articles (New!)
▸ Words that often appear near Maximum subarray problem
▸ Rhymes of Maximum subarray problem

▸ Invented words related to Maximum subarray problem