undefined | Better HN

0 pointspartycoder8y ago0 comments

Just that it takes extra space and that's sometimes a constraint.

0 comments

chii8y ago

In place merge sort exists. It's hard to write tho

Which decreases the space complexity but increases the time complexity.

_hrfd8y ago

No, the time complexity is the same: O(n log n). The author of the top answer links to his book, where you can find a proof of time complexity:

tomlx8y ago

This is beautiful. I will try to implement this once i'm at home ...

j / k navigate · click thread line to collapse