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.
"synopsis" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 108 pp. Englisch. Seller Inventory # 9786133712836
Quantity: 2 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computerscience, the maximum subarray problem is the task of finding thecontiguous subarray within a one-dimensional array of numbers(containing at least one positive number) which has the largest sum. Forexample, for the sequence of values ¿2, 1, ¿3, 4, ¿1, 2, 1, ¿5, 4; thecontiguous subarray with the largest sum is 4, ¿1, 2, 1, with sum 6.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 108 pp. Englisch. Seller Inventory # 9786133712836
Quantity: 1 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. Seller Inventory # 9786133712836
Quantity: 1 available