undefined | Better HN

0 points_hrfd8y ago0 comments

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:

0 comments

...but it increases run time. It's fine not to care on hidden constants while analyzing algorithms, but not while using them in real life

j / k navigate · click thread line to collapse

0 points_hrfd8y ago0 comments

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:

...but it increases run time. It's fine not to care on hidden constants while analyzing algorithms, but not while using them in real life

j / k navigate · click thread line to collapse