Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Two Kadane Algorithms for the Maximum Sum Sub-Array Problem

Version 1 : Received: 16 October 2023 / Approved: 17 October 2023 / Online: 17 October 2023 (11:09:03 CEST)

A peer-reviewed article of this Preprint also exists.

Kadane, J.B. Two Kadane Algorithms for the Maximum Sum Subarray Problem. Algorithms 2023, 16, 519. Kadane, J.B. Two Kadane Algorithms for the Maximum Sum Subarray Problem. Algorithms 2023, 16, 519.

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.

Keywords

dynamic programming; Kadane’s algorithm; linear algorithm; maximum subarray problem; miscommunication

Subject

Computer Science and Mathematics, Data Structures, Algorithms and Complexity

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.