Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

1
  • 1
    $\begingroup$ You did not missing anything. Your implementation is better. Your analysis is correct. I recommend that you edit the question so that it is titled "Can the maximum single sell profit by divide and conquer be O(n) ?", explaining the O(n log n) algorithms known to you. Then write an answer with your algorithm. $\endgroup$ Commented Mar 7, 2021 at 9:28