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

 
9786133712836: Maximum Subarray Problem: Computer science, Array, Ulf Grenander, Maximum likelihood, Linear time, Algorithm, Carnegie-Mellon University, Python (programming language)
Couverture souple
ISBN 10 : 613371283X ISBN 13 : 9786133712836
Editeur : Alphascript Publishing, 2010

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
613371283X
ISBN 13 
9786133712836
Reliure
Broché
Nombre de pages
108
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible