Maximum Subarray Problem: Computer science, Array, Ulf Grenander, Maximum likelihood, Linear time, Algorithm, Carnegie-Mellon University, Python (programming language) -
-25% koodiga BOOKS
Saadetis 15-21 tööpäeva jooksul
30-päevane tagastamisõigus
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 ... Täielik kirjeldus
Võib-olla meeldib sulle ka
Kirjeldus
Lisateave
| Kirjastaja | OmniScriptum |
|---|---|
| Väljalaskeaasta | 2026 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9786133712836 |