maximum subarray problem

I have implemented the O(n^3), O(n^2), O(n log n), O(n) algorithms. and ran some silly random tests.

some of the results for len(arr) = 100000

Screenshot from 2015-01-14 16:43:34

https://gist.github.com/5b391aa763bb70668a8a

. well that was something different..

Advertisements

2 thoughts on “maximum subarray problem

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s