subarray

A contiguous run of elements within an array, such as positions 3 through 7.

In more detail

Divide-and-conquer algorithms work on subarrays given by start and end indices rather than by copying slices. The maximum subarray problem asks for the contiguous run with the largest sum.

Related terms

Taught in

References