A comparative C++ implementation of Kadane's Algorithm and a brute-force technique for finding the maximum subarray sum. This project includes: max-subarray-sum/ ├── src/ │ ├── kadane.cpp // ...

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.

The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...