Revision as of 15:19, 13 September 2023 edit Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →Kadane's algorithm: performed swap ← Previous edit		Revision as of 08:26, 25 October 2023 edit undo Citation bot (talk \| contribs) Bots 5,863,450 edits Alter: title. Add: isbn. \| Use this bot. Report bugs. \| #UCB_CommandLine Next edit →
Line 203: \| first1 = Gerth Stølting \| last1 = Brodal \| first2 = Allan Grønlund \| last2 = Jørgensen \| title = Mathematical Foundations of Computer Science 2007 ▼ \| contribution = A linear time algorithm for the ''k'' maximal sums problem ▲ \| title = Mathematical Foundations of Computer Science \| publisher = Springer-Verlag \| series = Lecture Notes in Computer Science \| volume = 4708 \| year = 2007 \| pages = 442–453 \| doi = 10.1007/978-3-540-74456-6_40 \| isbn = 978-3-540-74455-9 }}. *{{citation \| url=https://core.ac.uk/download/pdf/82596333.pdf

Maximum subarray problem: Difference between revisions