-
Why merge sort is n log n?
情况
最差 分量
Questioner:Alex Smith 2023-06-17 12:09:49
The most authoritative answer in 2024
-

-
Ethan Hall——Studied at the University of Melbourne, Lives in Melbourne, Australia.
This is because whether it be worst case or average case the
merge sort just divide the array in two halves at each stage which gives it lg(n) component and the other N component comes from its comparisons that are made at each stage. So combining it becomes nearly O(nlg n).Oct 18, 2011
read more >>
About “情况、最差、分量”,people ask:
QuesHub is a place where questions meet answers, it is more authentic than Quora, but you still need to discern the answers provided by the respondents.