When people design algorithm with the divide and conguer method, out of the consideration of balancing, they always divide the problem into equivalent subproblems recursively. In many practical problems it is proved that the coefficient of time complexity can be improved by balancing the size of the subproblem. This paper is intended to deal with the problem and prove it in terms of merge sorting.