Maximum Subarray Algorithms implemented with Brute Force, Divide and Conquer, and ScanLine
-
Notifications
You must be signed in to change notification settings - Fork 0
Maximum Subarray Algorithms implemented with Brute Force, Divide and Conquer, and ScanLine. In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A[1...n] of numbers.
License
MatthiasBart/max_sub_array
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Maximum Subarray Algorithms implemented with Brute Force, Divide and Conquer, and ScanLine. In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A[1...n] of numbers.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published