Keywords

#maximum_subarray_problem

Maximum subarray problem

Problem in computer science

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. It can be solved in time and space.

Mon 26th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Maximum subarray problem Joseph Born Kadane Ruzzo–Tompa algorithm Counting sort Ulf Grenander Shellsort List of algorithms Binary search Active electronically scanned array External sorting
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.