Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

maximum subarray problem · Vinony

🌐English

English Português Tiếng Việt فارسی 中文

EntityQ1334332· pop 8· linked from 6 articles

maximum subarray problem

Also known as maximum sum subarray problem

the task of finding a contiguous subarray with the largest sum in a given array of numbers

Available in 8 languages

中文
Português
Georgian
Greek
Serbian
Tiếng Việt
فارسی

via Wikidata sitelinks · CC0

Connections

computer science

International Standard Book Number

Categories

Dynamic programming Optimization algorithms and methods Polynomial-time problems

Sources

wikipedia.externallinksexternallink

Q15777

Entity

digital object identifier

Edsger W. Dijkstra

array data structure

computer vision

Carnegie Mellon University

dynamic programming

maximum likelihood estimation

divide-and-conquer algorithm

shortest path problem

brute-force search

subset sum problem

Communications of the ACM

Sign in to save

What links here6 pages

time complexity

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

matrix splitting

Entitydist 0.65

Bernoulli's triangle

Entitydist 0.68

Entitydist 0.70

polynomials calculating sums of powers of arithmetic progressions

Entitydist 0.72

spigot algorithm

Entitydist 0.72

sociable number

Entitydist 0.72

generalized arithmetic progression

Entitydist 0.73

Sylvester's sequence

Entitydist 0.73

Entitydist 0.74

Vandermonde matrix

Entitydist 0.75

Entitydist 0.75

trinomial triangle

Entitydist 0.76