Two Kadane Algorithms for the Maximum Sum Sub-Array Problem

2023 · doi:10.20944/preprints202310.1061.v1
preprint OA: closed CC-BY-4.0
🔓 Open OA copy View at publisher

Abstract

The algorithm now known as Kadane’s algorithm for the maximum subarray problem uses many of the ideas that Kadane proposed, but it is not the algorithm that Kadane intended. This paper compares the two algorithms in question. They are both linear in time, employ just a few words of memory, and use a dynamic programming structure. The upshot is two light-weight algorithms for the maximum subarray problem.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-06-02T02:00:03.124865+00:00
License: CC-BY-4.0