TY - JOUR AU - Rojek, Tomasz PY - 2017/12/21 Y2 - 2024/03/28 TI - MAXIMUM SUBARRAY PROBLEM OPTIMIZATION FOR SPECIFIC DATA JF - Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska JA - IAPGOS VL - 7 IS - 4 SE - Articles DO - 10.5604/01.3001.0010.7507 UR - https://ph.pollub.pl/index.php/iapgos/article/view/1255 SP - 62-65 AB - <p>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 the algorithm causes a non significant performance loss (1% &gt; decrease in performance). The modification does not improve time complexity but reduces the number of elementary operations. Various experimental data sets have been used to evaluate possible time efficiency improvement. For the most favourable data sets an increase in efficiency of 25% can be achieved.</p> ER -