Maximum Subarray Problem: Computer science, Array, Ulf Grenander, Maximum likelihood, Linear time, Algorithm, Carnegie-Mellon University, Python (programming language) - Softcover

 
9786133712836: Maximum Subarray Problem: Computer science, Array, Ulf Grenander, Maximum likelihood, Linear time, Algorithm, Carnegie-Mellon University, Python (programming language)
Softcover
ISBN 10: 613371283X ISBN 13: 9786133712836
Verlag: OmniScriptum, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers (containing at least one positive number) which has the largest sum. For example, for the sequence of values −2, 1, −3, 4, −1, 2, 1, −5, 4; the contiguous subarray with the largest sum is 4, −1, 2, 1, with sum 6.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
OmniScriptum
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
613371283X
ISBN 13 
9786133712836
Einband
Tapa blanda
Anzahl der Seiten
108
Herausgeber
Miller Frederic P., Vandome Agnes F., McBrewster John
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar