This PR adds an implementation of Kadane's Algorithm, an efficient dynamic programming approach to solve the Maximum Subarray Sum problem in O(n) time. Initializes current and global maximum values.

Abstract: This letter presents a conformal microstrip array antenna and an associated imaging algorithm for microwave brain hemorrhage diagnostic systems. Each antenna element utilizes a ...

Bug: A naive solution may try all subarrays using nested loops (O(n²) or worse), which is too slow for large inputs. Expected: Use Kadane’s Algorithm (O(n)), which efficiently updates the running sum ...

Abstract: In this paper, a novel subarray-level adaptive beamforming algorithm is proposed to address performance degradation under low snapshot conditions and strong noise environments. The method ...