Feature/new feature: Implement Brute Force Maximum Subarray Sum Algorithm (O(n²))
#596
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This update introduces a brute force approach to finding the maximum subarray sum by iterating over all possible subarrays. It serves as an alternative to Kadane’s Algorithm, with a time complexity of O(n²).
Brief description of what is fixed or changed
This update adds a brute force implementation for finding the maximum subarray sum by iterating over all possible subarrays. Unlike Kadane’s algorithm (O(n)), this method follows an O(n²) complexity, making it useful for understanding naive approaches and verifying correctness in small test cases.