ISBN: 9786133712836 - Maximum Subarray Problem: Computer Science, Array, Ulf Grenander, Maximum Likelihood, Linear Time, Algorithm, Carnegie-mellon University, Python (programming Language) (3 results)

- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 134.68
£ 19.28 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 108 pp. Englisch.

- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 141.36
£ 29.34 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 134.68
£ 50.29 shippingShips from Germany to U.S.A.Quantity: 1 available
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.…