You are viewing a single comment's thread. Return to all comments →
Your solution is O(NlogN) by the sort algorithm, with dynamic programming is faster because it is linear.
Seems like cookies are disabled on this browser, please enable them to open this website
The Maximum Subarray
You are viewing a single comment's thread. Return to all comments →
Your solution is O(NlogN) by the sort algorithm, with dynamic programming is faster because it is linear.