MAXIMUM SUBARRAY PROBLEM OPTIMIZATION FOR SPECIFIC DATA
The maximum subarray problem (MSP) is to the find maximum contiguous sum in an array. This paper describes a method of Kadanes algorithm (the state of the art) optimization for specific data (continuous sequences of zeros or negative real numbers). When the data are unfavourable, the modification of...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Lublin University of Technology
2017-12-01
|
| Series: | Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska |
| Subjects: | |
| Online Access: | https://ph.pollub.pl/index.php/iapgos/article/view/1255 |