Maximum Subarray Problem: Computer science, Array, Ulf Grenander, Maximum likelihood, Linear time, Algorithm, Carnegie-Mellon University, Python (programming language) -
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
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 ... Full description
You May Also Like
Description
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786133712836 |