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

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.