Imperative Programming HT23, Maximum segment sum

Created: February 06, 2023 | Read markdown | About these notes | View in context | Study these flashcards |

Course - Imperative Programming I and II HT23^U

Flashcards

Programs

Program a worst-case $\Theta(n)$ time algorithm for finding the maximum segment sum in an array, i.e. $p$ and $q$ such that

\[\sum _ {i=p}^{q-1} a[i] \]

such that this is the maximum possible.

maximum-segment-sum-program

Todo.

@todo~

Course - Design and Analysis of Algorithms HT23^U

(incoming)
Course - Imperative Programming I and II HT23^U

(outgoing)
Lecture - Imperative Programming HT23, VIII^U

(incoming)
Notes - Imperative Programming HT23, Priority queues^U

(sim: 0.534)
Lecture - Design and Analysis of Algorithms HT23, III^U

(sim: 0.59)
Notes - DAA HT23, Greedy algorithms^U

(sim: 0.519)
Notes - DAA HT23, Dynamic programming^U

(sim: 0.516)