Bird (1D Maximum Subarray Maximum Subarray Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3911:39, 15 February 2023‎ Admin talk contribs‎ 334 bytes +334‎ Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary ??? (keep track of current tail sum and best sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == ??? == Year == 1989 == Reference == https://dl.acm.org/doi/10.1093/comjnl/32.2.122"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Bird_(1D_Maximum_Subarray_Maximum_Subarray_Problem)"