https://github.com/mmushfiq/maximumsubarray

Maximum subarray problem. Brute Force, Divide and Conquer, Kadane's Algorithm
https://github.com/mmushfiq/maximumsubarray

brute-force divide-and-conquer kadanes-algorithm largest-sum-contiguous-subarray maximum-subarray time-complexity

Last synced: 18 days ago
JSON representation

Maximum subarray problem. Brute Force, Divide and Conquer, Kadane's Algorithm

• Host: GitHub
• URL: https://github.com/mmushfiq/maximumsubarray
• Owner: mmushfiq
• Created: 2018-05-14T13:01:26.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2018-05-15T19:05:30.000Z (over 7 years ago)
• Last Synced: 2025-03-12T17:19:51.617Z (10 months ago)
• Topics: brute-force, divide-and-conquer, kadanes-algorithm, largest-sum-contiguous-subarray, maximum-subarray, time-complexity
• Language: Java
• Homepage: https://www.mycertnotes.com/az/maximum-subarray-problemi-kadane-alqoritmi/
• Size: 19.5 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# MaximumSubarray

Maximum subarray problem. Brute Force, Divide and Conquer, Kadane's Algorithm

More info: [https://www.mycertnotes.com/az/maximum-subarray-problemi-kadane-alqoritmi/](https://www.mycertnotes.com/az/maximum-subarray-problemi-kadane-alqoritmi/)

***

The following stock problem is given in [Introduction to Algorithms](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844) book (on page 68), you can solve it using "Maximum-subarray":

![maximum-subarray-practical-example](http://www.mycertnotes.com/wp-content/uploads/2017/07/maximum-subarray-practical-example.jpg)

***

It is shown three solution for maximum-subarray problem in this project:

N | Algorithm | Time complexity

----|----|----

1 | Brute-force | O(n^2)

2 | Divide and Conquer | O(nlogn)

3 | Kadane's Algorithm | O(n)




I compared these three solutions in my local machine and result was (duration is given with milliseconds):





Array length | Brute-force| Divide and Conquer | Kadane's Algorithm

----|----|----|----

1000 | 13 ms | 2 ms | 1 ms

1_000_000 | 646535 ms | 115 ms | 9 ms

***

### Time complexity:

![time-complexity](http://www.mycertnotes.com/wp-content/uploads/2017/07/rate-of-growth.jpg)