View source for Shamos (1D Maximum Subarray Maximum Subarray Problem)

← Shamos (1D Maximum Subarray Maximum Subarray Problem)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== Time Complexity == 

$O(n \log n)$

== Space Complexity == 

$O(\log n)$ words

(keep track of recursive maximums)

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 

Word/Real RAM

== Year == 

1978

== Reference == 

-

Return to Shamos (1D Maximum Subarray Maximum Subarray Problem).

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Shamos_(1D_Maximum_Subarray_Maximum_Subarray_Problem)"

Navigation menu