In each value of count, there are nested iterations. To create *left* and *right*, it need the O(n/count), and the merge one is O(count). So, the complexity is still like O(n/count) * O(count) = O(n) ?

I am not good at the algorithm. That's the reason I don't know how to calculate the complexity.